/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 21:42:21,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 21:42:21,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 21:42:21,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 21:42:21,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 21:42:21,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 21:42:21,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 21:42:21,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 21:42:22,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 21:42:22,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 21:42:22,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 21:42:22,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 21:42:22,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 21:42:22,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 21:42:22,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 21:42:22,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 21:42:22,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 21:42:22,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 21:42:22,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 21:42:22,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 21:42:22,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 21:42:22,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 21:42:22,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 21:42:22,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 21:42:22,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 21:42:22,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 21:42:22,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 21:42:22,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 21:42:22,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 21:42:22,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 21:42:22,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 21:42:22,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 21:42:22,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 21:42:22,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 21:42:22,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 21:42:22,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 21:42:22,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 21:42:22,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 21:42:22,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 21:42:22,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 21:42:22,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 21:42:22,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 21:42:22,059 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 21:42:22,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 21:42:22,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 21:42:22,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 21:42:22,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 21:42:22,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 21:42:22,063 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 21:42:22,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 21:42:22,063 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 21:42:22,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 21:42:22,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 21:42:22,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 21:42:22,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 21:42:22,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 21:42:22,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 21:42:22,065 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 21:42:22,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 21:42:22,065 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 21:42:22,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 21:42:22,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 21:42:22,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 21:42:22,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 21:42:22,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 21:42:22,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 21:42:22,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 21:42:22,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 21:42:22,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 21:42:22,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 21:42:22,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 21:42:22,067 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 21:42:22,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 21:42:22,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2021-06-05 21:42:22,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 21:42:22,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 21:42:22,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 21:42:22,402 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 21:42:22,403 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 21:42:22,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl [2021-06-05 21:42:22,414 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl' [2021-06-05 21:42:22,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 21:42:22,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 21:42:22,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 21:42:22,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 21:42:22,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 21:42:22,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 21:42:22,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 21:42:22,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 21:42:22,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 21:42:22,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... [2021-06-05 21:42:22,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 21:42:22,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 21:42:22,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 21:42:22,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 21:42:22,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 21:42:22,562 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 21:42:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 21:42:22,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 21:42:22,562 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 21:42:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 21:42:22,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 21:42:22,563 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 21:42:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 21:42:22,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 21:42:22,563 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 21:42:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 21:42:22,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 21:42:22,564 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 21:42:22,948 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 21:42:22,948 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-05 21:42:22,949 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2021-06-05 21:42:22,949 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2021-06-05 21:42:22,950 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread3EXIT is neither atomic block end nor error location. [2021-06-05 21:42:22,951 INFO L202 PluginConnector]: Adding new model array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:42:22 BoogieIcfgContainer [2021-06-05 21:42:22,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 21:42:22,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 21:42:22,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 21:42:22,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 21:42:22,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:42:22" (1/2) ... [2021-06-05 21:42:22,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239936ef and model type array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:42:22, skipping insertion in model container [2021-06-05 21:42:22,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:42:22" (2/2) ... [2021-06-05 21:42:22,957 INFO L111 eAbstractionObserver]: Analyzing ICFG array-int-subst.wvr.bpl [2021-06-05 21:42:22,961 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 21:42:22,961 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 21:42:22,961 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 21:42:22,961 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 21:42:23,002 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-05 21:42:23,019 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 21:42:23,055 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 21:42:23,055 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 21:42:23,055 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 21:42:23,055 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 21:42:23,055 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 21:42:23,056 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 21:42:23,056 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 21:42:23,056 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 21:42:23,062 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 68 flow [2021-06-05 21:42:23,074 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 21:42:23,081 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:23,082 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:23,082 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2084068600, now seen corresponding path program 1 times [2021-06-05 21:42:23,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:23,096 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120741454] [2021-06-05 21:42:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:23,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:23,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120741454] [2021-06-05 21:42:23,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120741454] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:42:23,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:42:23,329 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 21:42:23,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578409535] [2021-06-05 21:42:23,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 21:42:23,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 21:42:23,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:42:23,349 INFO L87 Difference]: Start difference. First operand has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:23,465 INFO L93 Difference]: Finished difference Result 139 states and 379 transitions. [2021-06-05 21:42:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:42:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 21:42:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:23,476 INFO L225 Difference]: With dead ends: 139 [2021-06-05 21:42:23,476 INFO L226 Difference]: Without dead ends: 135 [2021-06-05 21:42:23,477 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:42:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-06-05 21:42:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 84. [2021-06-05 21:42:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 2.819277108433735) internal successors, (234), 83 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 234 transitions. [2021-06-05 21:42:23,512 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 234 transitions. Word has length 14 [2021-06-05 21:42:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:23,513 INFO L482 AbstractCegarLoop]: Abstraction has 84 states and 234 transitions. [2021-06-05 21:42:23,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 234 transitions. [2021-06-05 21:42:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 21:42:23,515 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:23,515 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:23,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 21:42:23,515 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:23,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:23,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1063669592, now seen corresponding path program 2 times [2021-06-05 21:42:23,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:23,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229800352] [2021-06-05 21:42:23,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:23,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:23,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229800352] [2021-06-05 21:42:23,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229800352] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:42:23,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:42:23,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 21:42:23,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526120815] [2021-06-05 21:42:23,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 21:42:23,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:23,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 21:42:23,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:42:23,577 INFO L87 Difference]: Start difference. First operand 84 states and 234 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:23,695 INFO L93 Difference]: Finished difference Result 156 states and 429 transitions. [2021-06-05 21:42:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:42:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 21:42:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:23,701 INFO L225 Difference]: With dead ends: 156 [2021-06-05 21:42:23,701 INFO L226 Difference]: Without dead ends: 152 [2021-06-05 21:42:23,702 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:42:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-06-05 21:42:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2021-06-05 21:42:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.831460674157303) internal successors, (252), 89 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 252 transitions. [2021-06-05 21:42:23,722 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 252 transitions. Word has length 14 [2021-06-05 21:42:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:23,722 INFO L482 AbstractCegarLoop]: Abstraction has 90 states and 252 transitions. [2021-06-05 21:42:23,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 252 transitions. [2021-06-05 21:42:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 21:42:23,723 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:23,724 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:23,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 21:42:23,724 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash 284971666, now seen corresponding path program 3 times [2021-06-05 21:42:23,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:23,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704049264] [2021-06-05 21:42:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:23,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:23,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704049264] [2021-06-05 21:42:23,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704049264] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:42:23,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:42:23,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 21:42:23,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457856033] [2021-06-05 21:42:23,772 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 21:42:23,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 21:42:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:42:23,773 INFO L87 Difference]: Start difference. First operand 90 states and 252 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:23,869 INFO L93 Difference]: Finished difference Result 169 states and 467 transitions. [2021-06-05 21:42:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:42:23,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 21:42:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:23,875 INFO L225 Difference]: With dead ends: 169 [2021-06-05 21:42:23,875 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 21:42:23,879 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:42:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 21:42:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 94. [2021-06-05 21:42:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.838709677419355) internal successors, (264), 93 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 264 transitions. [2021-06-05 21:42:23,896 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 264 transitions. Word has length 14 [2021-06-05 21:42:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:23,896 INFO L482 AbstractCegarLoop]: Abstraction has 94 states and 264 transitions. [2021-06-05 21:42:23,896 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 264 transitions. [2021-06-05 21:42:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 21:42:23,897 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:23,897 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:23,898 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 21:42:23,898 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:23,898 INFO L82 PathProgramCache]: Analyzing trace with hash -791726200, now seen corresponding path program 4 times [2021-06-05 21:42:23,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:23,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885232796] [2021-06-05 21:42:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:23,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:23,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885232796] [2021-06-05 21:42:23,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885232796] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:42:23,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:42:23,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 21:42:23,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696022137] [2021-06-05 21:42:23,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 21:42:23,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:23,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 21:42:23,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:42:23,983 INFO L87 Difference]: Start difference. First operand 94 states and 264 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:24,073 INFO L93 Difference]: Finished difference Result 173 states and 479 transitions. [2021-06-05 21:42:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:42:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 21:42:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:24,075 INFO L225 Difference]: With dead ends: 173 [2021-06-05 21:42:24,075 INFO L226 Difference]: Without dead ends: 169 [2021-06-05 21:42:24,075 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:42:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-06-05 21:42:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 98. [2021-06-05 21:42:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.845360824742268) internal successors, (276), 97 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 276 transitions. [2021-06-05 21:42:24,080 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 276 transitions. Word has length 14 [2021-06-05 21:42:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:24,080 INFO L482 AbstractCegarLoop]: Abstraction has 98 states and 276 transitions. [2021-06-05 21:42:24,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 276 transitions. [2021-06-05 21:42:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 21:42:24,081 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:24,081 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:24,082 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 21:42:24,082 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1403359368, now seen corresponding path program 5 times [2021-06-05 21:42:24,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:24,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077599198] [2021-06-05 21:42:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:24,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:24,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077599198] [2021-06-05 21:42:24,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077599198] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:42:24,128 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:42:24,128 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 21:42:24,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629532601] [2021-06-05 21:42:24,129 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 21:42:24,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:24,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 21:42:24,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:42:24,130 INFO L87 Difference]: Start difference. First operand 98 states and 276 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:24,214 INFO L93 Difference]: Finished difference Result 176 states and 489 transitions. [2021-06-05 21:42:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:42:24,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 21:42:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:24,216 INFO L225 Difference]: With dead ends: 176 [2021-06-05 21:42:24,216 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 21:42:24,216 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:42:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 21:42:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 100. [2021-06-05 21:42:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.8484848484848486) internal successors, (282), 99 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 282 transitions. [2021-06-05 21:42:24,234 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 282 transitions. Word has length 14 [2021-06-05 21:42:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:24,234 INFO L482 AbstractCegarLoop]: Abstraction has 100 states and 282 transitions. [2021-06-05 21:42:24,235 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 282 transitions. [2021-06-05 21:42:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 21:42:24,243 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:24,243 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:24,243 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 21:42:24,243 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1756874686, now seen corresponding path program 6 times [2021-06-05 21:42:24,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:24,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481867902] [2021-06-05 21:42:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:24,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:24,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481867902] [2021-06-05 21:42:24,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481867902] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:42:24,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:42:24,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 21:42:24,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252165150] [2021-06-05 21:42:24,310 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 21:42:24,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:24,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 21:42:24,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:42:24,310 INFO L87 Difference]: Start difference. First operand 100 states and 282 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:24,414 INFO L93 Difference]: Finished difference Result 174 states and 483 transitions. [2021-06-05 21:42:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:42:24,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 21:42:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:24,417 INFO L225 Difference]: With dead ends: 174 [2021-06-05 21:42:24,417 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 21:42:24,418 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:42:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 21:42:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2021-06-05 21:42:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.8484848484848486) internal successors, (282), 99 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 282 transitions. [2021-06-05 21:42:24,428 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 282 transitions. Word has length 14 [2021-06-05 21:42:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:24,431 INFO L482 AbstractCegarLoop]: Abstraction has 100 states and 282 transitions. [2021-06-05 21:42:24,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 282 transitions. [2021-06-05 21:42:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:24,432 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:24,432 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:24,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 21:42:24,432 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1483038554, now seen corresponding path program 1 times [2021-06-05 21:42:24,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:24,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379022901] [2021-06-05 21:42:24,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:24,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:24,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379022901] [2021-06-05 21:42:24,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379022901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:24,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594045429] [2021-06-05 21:42:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:24,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:24,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:24,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594045429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:24,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:24,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 21:42:24,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356597697] [2021-06-05 21:42:24,839 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:24,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:24,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:24,840 INFO L87 Difference]: Start difference. First operand 100 states and 282 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:25,358 INFO L93 Difference]: Finished difference Result 239 states and 656 transitions. [2021-06-05 21:42:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:42:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:25,361 INFO L225 Difference]: With dead ends: 239 [2021-06-05 21:42:25,361 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 21:42:25,362 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 450.1ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:42:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 21:42:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 123. [2021-06-05 21:42:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.9836065573770494) internal successors, (364), 122 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 364 transitions. [2021-06-05 21:42:25,372 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 364 transitions. Word has length 15 [2021-06-05 21:42:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:25,372 INFO L482 AbstractCegarLoop]: Abstraction has 123 states and 364 transitions. [2021-06-05 21:42:25,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 364 transitions. [2021-06-05 21:42:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:25,374 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:25,374 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:25,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 21:42:25,597 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:25,598 INFO L82 PathProgramCache]: Analyzing trace with hash -180956976, now seen corresponding path program 1 times [2021-06-05 21:42:25,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:25,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935506862] [2021-06-05 21:42:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:25,666 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:25,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935506862] [2021-06-05 21:42:25,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935506862] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:25,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287070440] [2021-06-05 21:42:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:25,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:25,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:25,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287070440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:25,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:25,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 21:42:25,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310707159] [2021-06-05 21:42:25,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:25,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:25,797 INFO L87 Difference]: Start difference. First operand 123 states and 364 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:26,424 INFO L93 Difference]: Finished difference Result 257 states and 669 transitions. [2021-06-05 21:42:26,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 21:42:26,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:26,425 INFO L225 Difference]: With dead ends: 257 [2021-06-05 21:42:26,425 INFO L226 Difference]: Without dead ends: 187 [2021-06-05 21:42:26,426 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 505.8ms TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:42:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-06-05 21:42:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 133. [2021-06-05 21:42:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9318181818181817) internal successors, (387), 132 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 387 transitions. [2021-06-05 21:42:26,431 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 387 transitions. Word has length 15 [2021-06-05 21:42:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:26,431 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 387 transitions. [2021-06-05 21:42:26,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 387 transitions. [2021-06-05 21:42:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:26,432 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:26,432 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:26,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:26,649 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:26,649 INFO L82 PathProgramCache]: Analyzing trace with hash 479848854, now seen corresponding path program 1 times [2021-06-05 21:42:26,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:26,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893854898] [2021-06-05 21:42:26,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:26,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:26,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893854898] [2021-06-05 21:42:26,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893854898] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:26,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709136449] [2021-06-05 21:42:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:26,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:26,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:26,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709136449] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:26,893 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:26,893 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:26,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901875734] [2021-06-05 21:42:26,894 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:26,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:26,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:26,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:26,895 INFO L87 Difference]: Start difference. First operand 133 states and 387 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:27,146 INFO L93 Difference]: Finished difference Result 187 states and 522 transitions. [2021-06-05 21:42:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:27,147 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:27,149 INFO L225 Difference]: With dead ends: 187 [2021-06-05 21:42:27,149 INFO L226 Difference]: Without dead ends: 182 [2021-06-05 21:42:27,150 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 202.3ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-06-05 21:42:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2021-06-05 21:42:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.9305555555555554) internal successors, (422), 144 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 422 transitions. [2021-06-05 21:42:27,160 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 422 transitions. Word has length 15 [2021-06-05 21:42:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:27,161 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 422 transitions. [2021-06-05 21:42:27,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 422 transitions. [2021-06-05 21:42:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:27,162 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:27,162 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:27,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 21:42:27,384 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1061667084, now seen corresponding path program 2 times [2021-06-05 21:42:27,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:27,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631719628] [2021-06-05 21:42:27,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:27,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:27,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631719628] [2021-06-05 21:42:27,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631719628] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:27,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748556133] [2021-06-05 21:42:27,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:27,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:27,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:27,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:27,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:27,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748556133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:27,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:27,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:27,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757099033] [2021-06-05 21:42:27,651 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:27,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:27,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:27,651 INFO L87 Difference]: Start difference. First operand 145 states and 422 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:27,834 INFO L93 Difference]: Finished difference Result 197 states and 554 transitions. [2021-06-05 21:42:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:27,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:27,835 INFO L225 Difference]: With dead ends: 197 [2021-06-05 21:42:27,836 INFO L226 Difference]: Without dead ends: 192 [2021-06-05 21:42:27,836 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 174.2ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-06-05 21:42:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 147. [2021-06-05 21:42:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.952054794520548) internal successors, (431), 146 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 431 transitions. [2021-06-05 21:42:27,841 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 431 transitions. Word has length 15 [2021-06-05 21:42:27,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:27,841 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 431 transitions. [2021-06-05 21:42:27,841 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 431 transitions. [2021-06-05 21:42:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:27,842 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:27,842 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:28,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-05 21:42:28,057 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash -667380250, now seen corresponding path program 3 times [2021-06-05 21:42:28,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:28,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913514693] [2021-06-05 21:42:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:28,108 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:28,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913514693] [2021-06-05 21:42:28,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913514693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:28,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303333206] [2021-06-05 21:42:28,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:28,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:28,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:28,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:28,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:28,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303333206] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:28,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:28,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:42:28,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608915017] [2021-06-05 21:42:28,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:42:28,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:28,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:42:28,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:42:28,215 INFO L87 Difference]: Start difference. First operand 147 states and 431 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:28,372 INFO L93 Difference]: Finished difference Result 209 states and 593 transitions. [2021-06-05 21:42:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:28,374 INFO L225 Difference]: With dead ends: 209 [2021-06-05 21:42:28,374 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 21:42:28,375 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 95.0ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 21:42:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 153. [2021-06-05 21:42:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 21:42:28,380 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 21:42:28,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:28,381 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 21:42:28,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 21:42:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:28,381 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:28,381 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:28,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 21:42:28,604 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1754797532, now seen corresponding path program 4 times [2021-06-05 21:42:28,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:28,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548294645] [2021-06-05 21:42:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:28,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:28,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548294645] [2021-06-05 21:42:28,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548294645] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:28,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178680390] [2021-06-05 21:42:28,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:28,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:28,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:28,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:28,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:28,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178680390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:28,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:28,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:28,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280894866] [2021-06-05 21:42:28,835 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:28,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:28,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:28,836 INFO L87 Difference]: Start difference. First operand 153 states and 449 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:29,065 INFO L93 Difference]: Finished difference Result 276 states and 751 transitions. [2021-06-05 21:42:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:29,067 INFO L225 Difference]: With dead ends: 276 [2021-06-05 21:42:29,067 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 21:42:29,068 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 231.5ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 21:42:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 158. [2021-06-05 21:42:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 21:42:29,074 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 21:42:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:29,074 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 21:42:29,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 21:42:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:29,075 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:29,075 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:29,284 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:29,285 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1958351534, now seen corresponding path program 5 times [2021-06-05 21:42:29,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:29,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722456260] [2021-06-05 21:42:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:29,363 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:29,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722456260] [2021-06-05 21:42:29,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722456260] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:29,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747657907] [2021-06-05 21:42:29,363 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:29,390 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:29,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:29,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:29,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:29,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747657907] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:29,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:29,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:29,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468319583] [2021-06-05 21:42:29,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:29,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:29,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:29,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:29,496 INFO L87 Difference]: Start difference. First operand 158 states and 469 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:29,768 INFO L93 Difference]: Finished difference Result 276 states and 772 transitions. [2021-06-05 21:42:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:29,768 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:29,770 INFO L225 Difference]: With dead ends: 276 [2021-06-05 21:42:29,770 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 21:42:29,770 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 266.4ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 21:42:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2021-06-05 21:42:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 21:42:29,776 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 21:42:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:29,776 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 21:42:29,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 21:42:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:29,777 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:29,777 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:29,990 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-06-05 21:42:29,991 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:29,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1013363858, now seen corresponding path program 6 times [2021-06-05 21:42:29,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:29,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411527837] [2021-06-05 21:42:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:30,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:30,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411527837] [2021-06-05 21:42:30,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411527837] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:30,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967385126] [2021-06-05 21:42:30,071 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:30,114 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:30,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:30,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 21:42:30,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:30,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967385126] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:30,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:30,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:30,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194496541] [2021-06-05 21:42:30,202 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:30,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:30,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:30,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:30,203 INFO L87 Difference]: Start difference. First operand 153 states and 449 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:30,934 INFO L93 Difference]: Finished difference Result 275 states and 748 transitions. [2021-06-05 21:42:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:42:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:30,936 INFO L225 Difference]: With dead ends: 275 [2021-06-05 21:42:30,936 INFO L226 Difference]: Without dead ends: 270 [2021-06-05 21:42:30,936 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 626.6ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:42:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-06-05 21:42:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 153. [2021-06-05 21:42:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 21:42:30,942 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 21:42:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:30,942 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 21:42:30,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 21:42:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:30,943 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:30,943 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:31,167 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-06-05 21:42:31,167 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash 261780050, now seen corresponding path program 7 times [2021-06-05 21:42:31,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:31,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135288462] [2021-06-05 21:42:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:31,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:31,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135288462] [2021-06-05 21:42:31,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135288462] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:31,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451994034] [2021-06-05 21:42:31,247 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:31,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:31,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:31,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451994034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:31,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:31,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:31,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795639762] [2021-06-05 21:42:31,388 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:31,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:31,388 INFO L87 Difference]: Start difference. First operand 153 states and 449 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:31,690 INFO L93 Difference]: Finished difference Result 206 states and 576 transitions. [2021-06-05 21:42:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:31,692 INFO L225 Difference]: With dead ends: 206 [2021-06-05 21:42:31,692 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 21:42:31,692 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 259.4ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 21:42:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 154. [2021-06-05 21:42:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.947712418300654) internal successors, (451), 153 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 451 transitions. [2021-06-05 21:42:31,697 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 451 transitions. Word has length 15 [2021-06-05 21:42:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:31,697 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 451 transitions. [2021-06-05 21:42:31,697 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 451 transitions. [2021-06-05 21:42:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:31,698 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:31,698 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:31,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-06-05 21:42:31,913 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:31,914 INFO L82 PathProgramCache]: Analyzing trace with hash 970590554, now seen corresponding path program 2 times [2021-06-05 21:42:31,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:31,914 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450083430] [2021-06-05 21:42:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:31,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:31,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450083430] [2021-06-05 21:42:31,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450083430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:31,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111839624] [2021-06-05 21:42:31,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:32,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:32,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:32,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:32,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:32,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111839624] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:32,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:32,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 21:42:32,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872115876] [2021-06-05 21:42:32,081 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:32,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:32,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:32,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:32,082 INFO L87 Difference]: Start difference. First operand 154 states and 451 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:32,465 INFO L93 Difference]: Finished difference Result 315 states and 839 transitions. [2021-06-05 21:42:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:42:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:32,466 INFO L225 Difference]: With dead ends: 315 [2021-06-05 21:42:32,467 INFO L226 Difference]: Without dead ends: 273 [2021-06-05 21:42:32,467 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 303.0ms TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:42:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-06-05 21:42:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 168. [2021-06-05 21:42:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 3.0479041916167664) internal successors, (509), 167 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 509 transitions. [2021-06-05 21:42:32,473 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 509 transitions. Word has length 15 [2021-06-05 21:42:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:32,473 INFO L482 AbstractCegarLoop]: Abstraction has 168 states and 509 transitions. [2021-06-05 21:42:32,473 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 509 transitions. [2021-06-05 21:42:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:32,474 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:32,474 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:32,692 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:32,693 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:32,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:32,693 INFO L82 PathProgramCache]: Analyzing trace with hash 511164902, now seen corresponding path program 8 times [2021-06-05 21:42:32,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:32,693 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089009225] [2021-06-05 21:42:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:32,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:32,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089009225] [2021-06-05 21:42:32,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089009225] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:32,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093995016] [2021-06-05 21:42:32,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:32,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:32,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:32,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:32,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:32,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093995016] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:32,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:32,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:32,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457288893] [2021-06-05 21:42:32,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:32,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:32,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:32,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:32,922 INFO L87 Difference]: Start difference. First operand 168 states and 509 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:33,198 INFO L93 Difference]: Finished difference Result 259 states and 742 transitions. [2021-06-05 21:42:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:33,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:33,200 INFO L225 Difference]: With dead ends: 259 [2021-06-05 21:42:33,200 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 21:42:33,201 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 278.4ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 21:42:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 170. [2021-06-05 21:42:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.059171597633136) internal successors, (517), 169 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 517 transitions. [2021-06-05 21:42:33,207 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 517 transitions. Word has length 15 [2021-06-05 21:42:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:33,208 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 517 transitions. [2021-06-05 21:42:33,208 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 517 transitions. [2021-06-05 21:42:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:33,210 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:33,210 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:33,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-06-05 21:42:33,429 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:33,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1191223272, now seen corresponding path program 2 times [2021-06-05 21:42:33,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:33,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025566701] [2021-06-05 21:42:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:33,478 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:33,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025566701] [2021-06-05 21:42:33,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025566701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:33,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275008623] [2021-06-05 21:42:33,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:33,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:33,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:33,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:33,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:33,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275008623] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:33,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:33,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 21:42:33,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549139261] [2021-06-05 21:42:33,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:33,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:33,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:33,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:33,590 INFO L87 Difference]: Start difference. First operand 170 states and 517 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:33,891 INFO L93 Difference]: Finished difference Result 263 states and 728 transitions. [2021-06-05 21:42:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:42:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:33,893 INFO L225 Difference]: With dead ends: 263 [2021-06-05 21:42:33,893 INFO L226 Difference]: Without dead ends: 236 [2021-06-05 21:42:33,894 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 218.7ms TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-06-05 21:42:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 170. [2021-06-05 21:42:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.029585798816568) internal successors, (512), 169 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 512 transitions. [2021-06-05 21:42:33,899 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 512 transitions. Word has length 15 [2021-06-05 21:42:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:33,900 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 512 transitions. [2021-06-05 21:42:33,900 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 512 transitions. [2021-06-05 21:42:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:33,900 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:33,901 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:34,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-06-05 21:42:34,125 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:34,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1872721008, now seen corresponding path program 9 times [2021-06-05 21:42:34,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:34,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650822945] [2021-06-05 21:42:34,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:34,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:34,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650822945] [2021-06-05 21:42:34,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650822945] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:34,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723162528] [2021-06-05 21:42:34,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:34,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:34,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:34,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:34,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:34,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723162528] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:34,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:34,331 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:34,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489359592] [2021-06-05 21:42:34,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:34,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:34,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:34,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:34,334 INFO L87 Difference]: Start difference. First operand 170 states and 512 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:34,651 INFO L93 Difference]: Finished difference Result 230 states and 654 transitions. [2021-06-05 21:42:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:34,652 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:34,653 INFO L225 Difference]: With dead ends: 230 [2021-06-05 21:42:34,653 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 21:42:34,653 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 285.8ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 21:42:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 170. [2021-06-05 21:42:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.0236686390532546) internal successors, (511), 169 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 511 transitions. [2021-06-05 21:42:34,659 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 511 transitions. Word has length 15 [2021-06-05 21:42:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:34,659 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 511 transitions. [2021-06-05 21:42:34,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:34,660 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 511 transitions. [2021-06-05 21:42:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:34,660 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:34,660 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:34,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-06-05 21:42:34,877 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:34,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1743627284, now seen corresponding path program 3 times [2021-06-05 21:42:34,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:34,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329946687] [2021-06-05 21:42:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:34,921 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:34,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329946687] [2021-06-05 21:42:34,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329946687] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:34,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665218761] [2021-06-05 21:42:34,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:34,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:34,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:34,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:34,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:35,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665218761] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:35,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:35,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 21:42:35,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614708505] [2021-06-05 21:42:35,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:35,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:35,039 INFO L87 Difference]: Start difference. First operand 170 states and 511 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:35,397 INFO L93 Difference]: Finished difference Result 284 states and 758 transitions. [2021-06-05 21:42:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:42:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:35,399 INFO L225 Difference]: With dead ends: 284 [2021-06-05 21:42:35,399 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 21:42:35,400 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 243.1ms TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:42:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 21:42:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 159. [2021-06-05 21:42:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0) internal successors, (474), 158 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 474 transitions. [2021-06-05 21:42:35,405 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 474 transitions. Word has length 15 [2021-06-05 21:42:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:35,405 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 474 transitions. [2021-06-05 21:42:35,405 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 474 transitions. [2021-06-05 21:42:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:35,406 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:35,406 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:35,606 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:35,606 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1421782062, now seen corresponding path program 10 times [2021-06-05 21:42:35,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:35,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033939376] [2021-06-05 21:42:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:35,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:35,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033939376] [2021-06-05 21:42:35,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033939376] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:35,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874374029] [2021-06-05 21:42:35,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:35,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:35,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:35,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:35,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:35,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874374029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:35,765 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:35,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:35,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731538032] [2021-06-05 21:42:35,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:35,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:35,767 INFO L87 Difference]: Start difference. First operand 159 states and 474 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:35,909 INFO L93 Difference]: Finished difference Result 254 states and 734 transitions. [2021-06-05 21:42:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:35,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:35,910 INFO L225 Difference]: With dead ends: 254 [2021-06-05 21:42:35,910 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 21:42:35,910 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 92.0ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 21:42:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 161. [2021-06-05 21:42:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.0) internal successors, (480), 160 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 480 transitions. [2021-06-05 21:42:35,914 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 480 transitions. Word has length 15 [2021-06-05 21:42:35,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:35,915 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 480 transitions. [2021-06-05 21:42:35,915 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 480 transitions. [2021-06-05 21:42:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:35,915 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:35,915 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:36,128 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:36,129 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:36,129 INFO L82 PathProgramCache]: Analyzing trace with hash 4818636, now seen corresponding path program 11 times [2021-06-05 21:42:36,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:36,129 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691056900] [2021-06-05 21:42:36,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:36,177 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:36,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691056900] [2021-06-05 21:42:36,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691056900] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:36,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72484229] [2021-06-05 21:42:36,177 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:36,206 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:36,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:36,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:36,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:36,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72484229] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:36,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:36,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:42:36,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062586146] [2021-06-05 21:42:36,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:36,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:36,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:36,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:36,301 INFO L87 Difference]: Start difference. First operand 161 states and 480 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:36,423 INFO L93 Difference]: Finished difference Result 244 states and 694 transitions. [2021-06-05 21:42:36,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:36,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:36,425 INFO L225 Difference]: With dead ends: 244 [2021-06-05 21:42:36,425 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 21:42:36,425 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 114.5ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 21:42:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 163. [2021-06-05 21:42:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0123456790123457) internal successors, (488), 162 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 488 transitions. [2021-06-05 21:42:36,430 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 488 transitions. Word has length 15 [2021-06-05 21:42:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:36,430 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 488 transitions. [2021-06-05 21:42:36,430 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 488 transitions. [2021-06-05 21:42:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:36,430 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:36,431 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:36,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:36,645 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1366374742, now seen corresponding path program 12 times [2021-06-05 21:42:36,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:36,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454319409] [2021-06-05 21:42:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:36,696 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:36,696 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454319409] [2021-06-05 21:42:36,696 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454319409] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:36,696 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523532597] [2021-06-05 21:42:36,696 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:36,740 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:36,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:36,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:36,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:36,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523532597] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:36,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:36,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:42:36,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272792412] [2021-06-05 21:42:36,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:36,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:36,833 INFO L87 Difference]: Start difference. First operand 163 states and 488 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:36,944 INFO L93 Difference]: Finished difference Result 217 states and 622 transitions. [2021-06-05 21:42:36,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:36,944 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:36,945 INFO L225 Difference]: With dead ends: 217 [2021-06-05 21:42:36,945 INFO L226 Difference]: Without dead ends: 211 [2021-06-05 21:42:36,946 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 98.1ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-06-05 21:42:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 161. [2021-06-05 21:42:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.0) internal successors, (480), 160 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 480 transitions. [2021-06-05 21:42:36,950 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 480 transitions. Word has length 15 [2021-06-05 21:42:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:36,950 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 480 transitions. [2021-06-05 21:42:36,950 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 480 transitions. [2021-06-05 21:42:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:36,951 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:36,951 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:37,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:37,165 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1908842768, now seen corresponding path program 3 times [2021-06-05 21:42:37,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:37,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821841571] [2021-06-05 21:42:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:37,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:37,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821841571] [2021-06-05 21:42:37,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821841571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:37,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272006151] [2021-06-05 21:42:37,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:37,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:37,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:37,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:37,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:37,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272006151] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:37,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:37,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 21:42:37,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128302931] [2021-06-05 21:42:37,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:37,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:37,287 INFO L87 Difference]: Start difference. First operand 161 states and 480 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:37,609 INFO L93 Difference]: Finished difference Result 274 states and 770 transitions. [2021-06-05 21:42:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:42:37,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:37,611 INFO L225 Difference]: With dead ends: 274 [2021-06-05 21:42:37,611 INFO L226 Difference]: Without dead ends: 221 [2021-06-05 21:42:37,611 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 239.1ms TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:42:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-06-05 21:42:37,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 158. [2021-06-05 21:42:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 21:42:37,617 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 21:42:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:37,617 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 21:42:37,617 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 21:42:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:37,618 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:37,618 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:37,842 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2021-06-05 21:42:37,842 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:37,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1057034826, now seen corresponding path program 13 times [2021-06-05 21:42:37,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:37,843 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720211095] [2021-06-05 21:42:37,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:37,910 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:37,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720211095] [2021-06-05 21:42:37,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720211095] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:37,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98772844] [2021-06-05 21:42:37,910 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:37,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:37,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:38,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98772844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:38,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:38,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:38,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358306250] [2021-06-05 21:42:38,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:38,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:38,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:38,043 INFO L87 Difference]: Start difference. First operand 158 states and 469 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:38,258 INFO L93 Difference]: Finished difference Result 270 states and 738 transitions. [2021-06-05 21:42:38,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:38,260 INFO L225 Difference]: With dead ends: 270 [2021-06-05 21:42:38,260 INFO L226 Difference]: Without dead ends: 265 [2021-06-05 21:42:38,260 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 211.3ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-05 21:42:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2021-06-05 21:42:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0185185185185186) internal successors, (489), 162 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 489 transitions. [2021-06-05 21:42:38,265 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 489 transitions. Word has length 15 [2021-06-05 21:42:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:38,265 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 489 transitions. [2021-06-05 21:42:38,265 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 489 transitions. [2021-06-05 21:42:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:38,266 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:38,266 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:38,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-06-05 21:42:38,488 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:38,488 INFO L82 PathProgramCache]: Analyzing trace with hash -475216596, now seen corresponding path program 14 times [2021-06-05 21:42:38,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:38,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813105820] [2021-06-05 21:42:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:38,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:38,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813105820] [2021-06-05 21:42:38,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813105820] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:38,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493106741] [2021-06-05 21:42:38,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:38,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:38,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:38,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:38,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:38,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493106741] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:38,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:38,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:38,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951795588] [2021-06-05 21:42:38,723 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:38,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:38,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:38,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:38,724 INFO L87 Difference]: Start difference. First operand 163 states and 489 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:38,945 INFO L93 Difference]: Finished difference Result 280 states and 770 transitions. [2021-06-05 21:42:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:38,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:38,947 INFO L225 Difference]: With dead ends: 280 [2021-06-05 21:42:38,947 INFO L226 Difference]: Without dead ends: 275 [2021-06-05 21:42:38,947 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 227.7ms TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-06-05 21:42:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 158. [2021-06-05 21:42:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 21:42:38,952 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 21:42:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:38,952 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 21:42:38,952 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 21:42:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:38,952 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:38,953 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:39,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2021-06-05 21:42:39,169 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:39,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1798468500, now seen corresponding path program 15 times [2021-06-05 21:42:39,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:39,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078708846] [2021-06-05 21:42:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:39,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:39,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078708846] [2021-06-05 21:42:39,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078708846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:39,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34906883] [2021-06-05 21:42:39,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:39,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:39,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:39,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:39,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:39,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34906883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:39,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:39,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:39,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661266805] [2021-06-05 21:42:39,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:39,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:39,375 INFO L87 Difference]: Start difference. First operand 158 states and 469 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:39,655 INFO L93 Difference]: Finished difference Result 305 states and 819 transitions. [2021-06-05 21:42:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:39,657 INFO L225 Difference]: With dead ends: 305 [2021-06-05 21:42:39,657 INFO L226 Difference]: Without dead ends: 300 [2021-06-05 21:42:39,657 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 266.3ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-06-05 21:42:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 160. [2021-06-05 21:42:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.9748427672955975) internal successors, (473), 159 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 473 transitions. [2021-06-05 21:42:39,661 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 473 transitions. Word has length 15 [2021-06-05 21:42:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:39,661 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 473 transitions. [2021-06-05 21:42:39,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 473 transitions. [2021-06-05 21:42:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:39,662 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:39,662 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:39,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2021-06-05 21:42:39,884 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:39,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:39,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1744914988, now seen corresponding path program 16 times [2021-06-05 21:42:39,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:39,884 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423267521] [2021-06-05 21:42:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:39,969 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:39,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423267521] [2021-06-05 21:42:39,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423267521] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:39,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217070562] [2021-06-05 21:42:39,969 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:40,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:40,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:40,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:40,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:40,114 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217070562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:40,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:40,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:40,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353249359] [2021-06-05 21:42:40,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:40,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:40,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:40,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:40,117 INFO L87 Difference]: Start difference. First operand 160 states and 473 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:40,463 INFO L93 Difference]: Finished difference Result 284 states and 780 transitions. [2021-06-05 21:42:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:40,465 INFO L225 Difference]: With dead ends: 284 [2021-06-05 21:42:40,465 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 21:42:40,465 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 325.9ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 21:42:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 158. [2021-06-05 21:42:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 21:42:40,470 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 21:42:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:40,470 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 21:42:40,470 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 21:42:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:40,470 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:40,470 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:40,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:40,689 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1994299840, now seen corresponding path program 17 times [2021-06-05 21:42:40,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:40,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532350329] [2021-06-05 21:42:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:40,758 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:40,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532350329] [2021-06-05 21:42:40,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532350329] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:40,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234646591] [2021-06-05 21:42:40,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:40,783 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:40,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:40,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:40,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:40,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234646591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:40,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:40,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:40,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533833143] [2021-06-05 21:42:40,886 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:40,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:40,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:40,886 INFO L87 Difference]: Start difference. First operand 158 states and 469 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:41,110 INFO L93 Difference]: Finished difference Result 306 states and 841 transitions. [2021-06-05 21:42:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:41,112 INFO L225 Difference]: With dead ends: 306 [2021-06-05 21:42:41,112 INFO L226 Difference]: Without dead ends: 301 [2021-06-05 21:42:41,112 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 240.0ms TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-06-05 21:42:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 159. [2021-06-05 21:42:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.9873417721518987) internal successors, (472), 158 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 472 transitions. [2021-06-05 21:42:41,117 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 472 transitions. Word has length 15 [2021-06-05 21:42:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:41,117 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 472 transitions. [2021-06-05 21:42:41,117 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 472 transitions. [2021-06-05 21:42:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:41,117 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:41,118 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:41,332 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:41,333 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1620609086, now seen corresponding path program 4 times [2021-06-05 21:42:41,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:41,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156194805] [2021-06-05 21:42:41,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:41,373 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:41,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156194805] [2021-06-05 21:42:41,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156194805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:41,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370826485] [2021-06-05 21:42:41,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:41,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:41,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:41,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:41,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:41,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370826485] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:41,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:41,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 21:42:41,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502075824] [2021-06-05 21:42:41,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:41,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:41,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:41,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:41,459 INFO L87 Difference]: Start difference. First operand 159 states and 472 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:41,676 INFO L93 Difference]: Finished difference Result 251 states and 682 transitions. [2021-06-05 21:42:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:42:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:41,677 INFO L225 Difference]: With dead ends: 251 [2021-06-05 21:42:41,678 INFO L226 Difference]: Without dead ends: 229 [2021-06-05 21:42:41,678 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 156.4ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:42:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-06-05 21:42:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 155. [2021-06-05 21:42:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.9415584415584415) internal successors, (453), 154 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 453 transitions. [2021-06-05 21:42:41,681 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 453 transitions. Word has length 15 [2021-06-05 21:42:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:41,681 INFO L482 AbstractCegarLoop]: Abstraction has 155 states and 453 transitions. [2021-06-05 21:42:41,681 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 453 transitions. [2021-06-05 21:42:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:41,682 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:41,682 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:41,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:41,895 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash -939111350, now seen corresponding path program 18 times [2021-06-05 21:42:41,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:41,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511327722] [2021-06-05 21:42:41,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:41,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:41,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511327722] [2021-06-05 21:42:41,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511327722] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:41,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142414306] [2021-06-05 21:42:41,964 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:41,995 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:41,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:41,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:41,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:42,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142414306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:42,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:42,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:42,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141533158] [2021-06-05 21:42:42,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:42,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:42,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:42,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:42,099 INFO L87 Difference]: Start difference. First operand 155 states and 453 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:42,391 INFO L93 Difference]: Finished difference Result 284 states and 778 transitions. [2021-06-05 21:42:42,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:42,392 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:42,393 INFO L225 Difference]: With dead ends: 284 [2021-06-05 21:42:42,393 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 21:42:42,393 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 279.0ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 21:42:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 151. [2021-06-05 21:42:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.9133333333333336) internal successors, (437), 150 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 437 transitions. [2021-06-05 21:42:42,397 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 437 transitions. Word has length 15 [2021-06-05 21:42:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:42,397 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 437 transitions. [2021-06-05 21:42:42,397 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 437 transitions. [2021-06-05 21:42:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:42,398 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:42,398 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:42,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2021-06-05 21:42:42,609 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:42,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:42,609 INFO L82 PathProgramCache]: Analyzing trace with hash 738121340, now seen corresponding path program 5 times [2021-06-05 21:42:42,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:42,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300300146] [2021-06-05 21:42:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:42,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:42,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300300146] [2021-06-05 21:42:42,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300300146] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:42,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771654056] [2021-06-05 21:42:42,647 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:42,674 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:42,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:42,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 21:42:42,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:42,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771654056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:42,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:42,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:42:42,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788316740] [2021-06-05 21:42:42,725 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:42:42,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:42,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:42:42,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:42:42,726 INFO L87 Difference]: Start difference. First operand 151 states and 437 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:42,838 INFO L93 Difference]: Finished difference Result 221 states and 607 transitions. [2021-06-05 21:42:42,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:42,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:42,840 INFO L225 Difference]: With dead ends: 221 [2021-06-05 21:42:42,840 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 21:42:42,841 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 21:42:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 133. [2021-06-05 21:42:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9393939393939394) internal successors, (388), 132 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 388 transitions. [2021-06-05 21:42:42,845 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 388 transitions. Word has length 15 [2021-06-05 21:42:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:42,845 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 388 transitions. [2021-06-05 21:42:42,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 388 transitions. [2021-06-05 21:42:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:42,845 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:42,845 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:43,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2021-06-05 21:42:43,057 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash -338576526, now seen corresponding path program 6 times [2021-06-05 21:42:43,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:43,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983604228] [2021-06-05 21:42:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:43,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:43,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983604228] [2021-06-05 21:42:43,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983604228] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:43,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217552349] [2021-06-05 21:42:43,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:43,133 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:43,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:43,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:43,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:43,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217552349] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:43,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:43,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 21:42:43,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021025006] [2021-06-05 21:42:43,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:43,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:43,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:43,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:43,186 INFO L87 Difference]: Start difference. First operand 133 states and 388 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:43,406 INFO L93 Difference]: Finished difference Result 237 states and 658 transitions. [2021-06-05 21:42:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 21:42:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:43,407 INFO L225 Difference]: With dead ends: 237 [2021-06-05 21:42:43,407 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 21:42:43,407 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 158.4ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:42:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 21:42:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 135. [2021-06-05 21:42:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.955223880597015) internal successors, (396), 134 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 396 transitions. [2021-06-05 21:42:43,411 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 396 transitions. Word has length 15 [2021-06-05 21:42:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:43,411 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 396 transitions. [2021-06-05 21:42:43,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 396 transitions. [2021-06-05 21:42:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:43,412 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:43,412 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:43,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2021-06-05 21:42:43,634 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:43,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1210723178, now seen corresponding path program 19 times [2021-06-05 21:42:43,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:43,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599435913] [2021-06-05 21:42:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:43,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:43,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599435913] [2021-06-05 21:42:43,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599435913] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:43,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463938019] [2021-06-05 21:42:43,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:43,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:43,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:43,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463938019] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:43,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:43,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:43,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275490874] [2021-06-05 21:42:43,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:43,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:43,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:43,819 INFO L87 Difference]: Start difference. First operand 135 states and 396 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:44,035 INFO L93 Difference]: Finished difference Result 203 states and 539 transitions. [2021-06-05 21:42:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:44,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:44,036 INFO L225 Difference]: With dead ends: 203 [2021-06-05 21:42:44,036 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 21:42:44,036 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 232.1ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 21:42:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 137. [2021-06-05 21:42:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.9411764705882355) internal successors, (400), 136 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 400 transitions. [2021-06-05 21:42:44,039 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 400 transitions. Word has length 15 [2021-06-05 21:42:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:44,039 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 400 transitions. [2021-06-05 21:42:44,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 400 transitions. [2021-06-05 21:42:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:44,040 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:44,040 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:44,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:44,245 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:44,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:44,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1962306986, now seen corresponding path program 20 times [2021-06-05 21:42:44,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:44,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638929044] [2021-06-05 21:42:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:44,304 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:44,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638929044] [2021-06-05 21:42:44,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638929044] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:44,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483475662] [2021-06-05 21:42:44,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:44,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:44,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:44,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:44,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:44,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483475662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:44,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:44,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:44,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401343521] [2021-06-05 21:42:44,446 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:44,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:44,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:44,447 INFO L87 Difference]: Start difference. First operand 137 states and 400 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:44,702 INFO L93 Difference]: Finished difference Result 202 states and 540 transitions. [2021-06-05 21:42:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:44,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:44,703 INFO L225 Difference]: With dead ends: 202 [2021-06-05 21:42:44,703 INFO L226 Difference]: Without dead ends: 196 [2021-06-05 21:42:44,703 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 244.4ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:42:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-06-05 21:42:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2021-06-05 21:42:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.955223880597015) internal successors, (396), 134 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 396 transitions. [2021-06-05 21:42:44,705 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 396 transitions. Word has length 15 [2021-06-05 21:42:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:44,706 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 396 transitions. [2021-06-05 21:42:44,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 396 transitions. [2021-06-05 21:42:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:44,706 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:44,706 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:44,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2021-06-05 21:42:44,917 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:44,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1226951760, now seen corresponding path program 4 times [2021-06-05 21:42:44,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:44,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967167007] [2021-06-05 21:42:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:44,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:44,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967167007] [2021-06-05 21:42:44,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967167007] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:44,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377859533] [2021-06-05 21:42:44,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:44,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:44,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:44,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 21:42:44,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:45,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377859533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:45,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:45,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:45,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413677462] [2021-06-05 21:42:45,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:45,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:45,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:45,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:45,034 INFO L87 Difference]: Start difference. First operand 135 states and 396 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:45,142 INFO L93 Difference]: Finished difference Result 205 states and 542 transitions. [2021-06-05 21:42:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:45,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:45,143 INFO L225 Difference]: With dead ends: 205 [2021-06-05 21:42:45,144 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 21:42:45,144 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 85.5ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 21:42:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2021-06-05 21:42:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9357142857142855) internal successors, (411), 140 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 411 transitions. [2021-06-05 21:42:45,147 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 411 transitions. Word has length 15 [2021-06-05 21:42:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:45,147 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 411 transitions. [2021-06-05 21:42:45,147 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 411 transitions. [2021-06-05 21:42:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:45,147 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:45,147 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:45,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:45,348 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:45,348 INFO L82 PathProgramCache]: Analyzing trace with hash -886595830, now seen corresponding path program 21 times [2021-06-05 21:42:45,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:45,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573124384] [2021-06-05 21:42:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:45,407 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:45,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573124384] [2021-06-05 21:42:45,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573124384] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:45,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569345697] [2021-06-05 21:42:45,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:45,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:45,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:45,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:45,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:45,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569345697] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:45,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:45,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:42:45,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101984032] [2021-06-05 21:42:45,532 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:42:45,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:42:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:42:45,533 INFO L87 Difference]: Start difference. First operand 141 states and 411 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:45,723 INFO L93 Difference]: Finished difference Result 181 states and 502 transitions. [2021-06-05 21:42:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:45,724 INFO L225 Difference]: With dead ends: 181 [2021-06-05 21:42:45,724 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 21:42:45,724 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 195.8ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:42:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 21:42:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2021-06-05 21:42:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9285714285714284) internal successors, (410), 140 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 410 transitions. [2021-06-05 21:42:45,727 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 410 transitions. Word has length 15 [2021-06-05 21:42:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:45,727 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 410 transitions. [2021-06-05 21:42:45,727 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 410 transitions. [2021-06-05 21:42:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:45,728 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:45,728 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:45,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2021-06-05 21:42:45,945 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1651983020, now seen corresponding path program 5 times [2021-06-05 21:42:45,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:45,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537931972] [2021-06-05 21:42:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:45,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:45,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537931972] [2021-06-05 21:42:45,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537931972] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:45,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180370923] [2021-06-05 21:42:45,983 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:46,026 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:46,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:46,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 21:42:46,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:46,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180370923] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:46,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:46,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:46,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272586725] [2021-06-05 21:42:46,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:46,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:46,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:46,083 INFO L87 Difference]: Start difference. First operand 141 states and 410 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:46,198 INFO L93 Difference]: Finished difference Result 190 states and 512 transitions. [2021-06-05 21:42:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:46,199 INFO L225 Difference]: With dead ends: 190 [2021-06-05 21:42:46,199 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 21:42:46,200 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.5ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 21:42:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 21:42:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.948148148148148) internal successors, (398), 135 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 398 transitions. [2021-06-05 21:42:46,202 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 398 transitions. Word has length 15 [2021-06-05 21:42:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:46,202 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 398 transitions. [2021-06-05 21:42:46,202 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 398 transitions. [2021-06-05 21:42:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:46,203 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:46,203 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:46,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable131 [2021-06-05 21:42:46,417 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1441032960, now seen corresponding path program 6 times [2021-06-05 21:42:46,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:46,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695512103] [2021-06-05 21:42:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:46,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:46,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695512103] [2021-06-05 21:42:46,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695512103] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:46,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351673197] [2021-06-05 21:42:46,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:46,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:46,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:46,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:46,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:46,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351673197] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:46,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:46,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 21:42:46,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249182119] [2021-06-05 21:42:46,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:46,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:46,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:46,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:46,556 INFO L87 Difference]: Start difference. First operand 136 states and 398 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:46,870 INFO L93 Difference]: Finished difference Result 214 states and 572 transitions. [2021-06-05 21:42:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:42:46,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:46,871 INFO L225 Difference]: With dead ends: 214 [2021-06-05 21:42:46,871 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 21:42:46,872 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 245.7ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:42:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 21:42:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 137. [2021-06-05 21:42:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.8970588235294117) internal successors, (394), 136 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 394 transitions. [2021-06-05 21:42:46,874 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 394 transitions. Word has length 15 [2021-06-05 21:42:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:46,875 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 394 transitions. [2021-06-05 21:42:46,875 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 394 transitions. [2021-06-05 21:42:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:46,875 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:46,875 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:47,089 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2021-06-05 21:42:47,089 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 981607308, now seen corresponding path program 22 times [2021-06-05 21:42:47,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:47,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038893427] [2021-06-05 21:42:47,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:47,155 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:47,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038893427] [2021-06-05 21:42:47,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038893427] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:47,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993007189] [2021-06-05 21:42:47,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:47,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:47,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:47,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:47,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:47,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993007189] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:47,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:47,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:47,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056961187] [2021-06-05 21:42:47,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:47,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:47,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:47,273 INFO L87 Difference]: Start difference. First operand 137 states and 394 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:47,468 INFO L93 Difference]: Finished difference Result 214 states and 591 transitions. [2021-06-05 21:42:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:47,469 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:47,469 INFO L225 Difference]: With dead ends: 214 [2021-06-05 21:42:47,469 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 21:42:47,470 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 182.4ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:42:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 21:42:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2021-06-05 21:42:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9285714285714284) internal successors, (410), 140 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 410 transitions. [2021-06-05 21:42:47,473 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 410 transitions. Word has length 15 [2021-06-05 21:42:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:47,473 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 410 transitions. [2021-06-05 21:42:47,473 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 410 transitions. [2021-06-05 21:42:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:47,474 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:47,474 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:47,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2021-06-05 21:42:47,689 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1951803882, now seen corresponding path program 23 times [2021-06-05 21:42:47,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:47,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082534715] [2021-06-05 21:42:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:47,751 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:47,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082534715] [2021-06-05 21:42:47,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082534715] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:47,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255475503] [2021-06-05 21:42:47,751 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:47,778 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:47,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:47,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:47,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:47,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255475503] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:47,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:47,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:42:47,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52819472] [2021-06-05 21:42:47,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:42:47,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:42:47,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:47,895 INFO L87 Difference]: Start difference. First operand 141 states and 410 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:48,117 INFO L93 Difference]: Finished difference Result 223 states and 605 transitions. [2021-06-05 21:42:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:48,118 INFO L225 Difference]: With dead ends: 223 [2021-06-05 21:42:48,119 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 21:42:48,119 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 225.9ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:42:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 21:42:48,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 140. [2021-06-05 21:42:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.9280575539568345) internal successors, (407), 139 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 407 transitions. [2021-06-05 21:42:48,125 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 407 transitions. Word has length 15 [2021-06-05 21:42:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:48,125 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 407 transitions. [2021-06-05 21:42:48,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 407 transitions. [2021-06-05 21:42:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:48,126 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:48,126 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:48,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:48,341 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1273184878, now seen corresponding path program 7 times [2021-06-05 21:42:48,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:48,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770210298] [2021-06-05 21:42:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:48,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:48,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770210298] [2021-06-05 21:42:48,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770210298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:48,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271110719] [2021-06-05 21:42:48,380 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:48,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:48,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:48,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271110719] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:48,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:48,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 21:42:48,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084756551] [2021-06-05 21:42:48,468 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:48,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:48,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:48,469 INFO L87 Difference]: Start difference. First operand 140 states and 407 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:48,741 INFO L93 Difference]: Finished difference Result 227 states and 607 transitions. [2021-06-05 21:42:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:42:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:48,742 INFO L225 Difference]: With dead ends: 227 [2021-06-05 21:42:48,742 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 21:42:48,742 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 197.2ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:42:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 21:42:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2021-06-05 21:42:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8805970149253732) internal successors, (386), 134 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 386 transitions. [2021-06-05 21:42:48,745 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 386 transitions. Word has length 15 [2021-06-05 21:42:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:48,745 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 386 transitions. [2021-06-05 21:42:48,745 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 386 transitions. [2021-06-05 21:42:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:48,745 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:48,745 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:48,946 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2021-06-05 21:42:48,946 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1807933612, now seen corresponding path program 24 times [2021-06-05 21:42:48,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:48,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278102059] [2021-06-05 21:42:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:49,002 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:49,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278102059] [2021-06-05 21:42:49,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278102059] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:49,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785542900] [2021-06-05 21:42:49,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:49,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:49,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:49,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:49,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:49,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785542900] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:49,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:49,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:42:49,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80971644] [2021-06-05 21:42:49,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:42:49,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:42:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:42:49,137 INFO L87 Difference]: Start difference. First operand 135 states and 386 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:49,302 INFO L93 Difference]: Finished difference Result 190 states and 521 transitions. [2021-06-05 21:42:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:49,303 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:49,305 INFO L225 Difference]: With dead ends: 190 [2021-06-05 21:42:49,305 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 21:42:49,305 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 165.4ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:42:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 21:42:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 21:42:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.8666666666666667) internal successors, (387), 135 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 387 transitions. [2021-06-05 21:42:49,308 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 387 transitions. Word has length 15 [2021-06-05 21:42:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:49,308 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 387 transitions. [2021-06-05 21:42:49,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 387 transitions. [2021-06-05 21:42:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:49,309 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:49,309 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:49,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:49,526 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1042546422, now seen corresponding path program 8 times [2021-06-05 21:42:49,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:49,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867011283] [2021-06-05 21:42:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:49,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:49,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867011283] [2021-06-05 21:42:49,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867011283] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:49,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325364799] [2021-06-05 21:42:49,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:49,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:49,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:49,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:49,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:49,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325364799] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:49,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:49,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 21:42:49,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118556492] [2021-06-05 21:42:49,659 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:49,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:49,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:49,660 INFO L87 Difference]: Start difference. First operand 136 states and 387 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:50,003 INFO L93 Difference]: Finished difference Result 269 states and 705 transitions. [2021-06-05 21:42:50,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 21:42:50,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:50,004 INFO L225 Difference]: With dead ends: 269 [2021-06-05 21:42:50,004 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 21:42:50,005 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 252.8ms TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:42:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 21:42:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 111. [2021-06-05 21:42:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.8727272727272726) internal successors, (316), 110 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 316 transitions. [2021-06-05 21:42:50,007 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 316 transitions. Word has length 15 [2021-06-05 21:42:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:50,007 INFO L482 AbstractCegarLoop]: Abstraction has 111 states and 316 transitions. [2021-06-05 21:42:50,007 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 316 transitions. [2021-06-05 21:42:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:50,008 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:50,008 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:50,208 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2021-06-05 21:42:50,208 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:50,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1544487814, now seen corresponding path program 25 times [2021-06-05 21:42:50,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:50,209 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113498207] [2021-06-05 21:42:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:50,273 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:50,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113498207] [2021-06-05 21:42:50,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113498207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:50,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285180556] [2021-06-05 21:42:50,274 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:50,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:50,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:50,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285180556] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:50,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:50,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:42:50,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770146935] [2021-06-05 21:42:50,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:42:50,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:42:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:42:50,396 INFO L87 Difference]: Start difference. First operand 111 states and 316 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:50,567 INFO L93 Difference]: Finished difference Result 195 states and 547 transitions. [2021-06-05 21:42:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:50,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:50,568 INFO L225 Difference]: With dead ends: 195 [2021-06-05 21:42:50,568 INFO L226 Difference]: Without dead ends: 190 [2021-06-05 21:42:50,569 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 140.3ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:42:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-06-05 21:42:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 115. [2021-06-05 21:42:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.8771929824561404) internal successors, (328), 114 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 328 transitions. [2021-06-05 21:42:50,571 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 328 transitions. Word has length 15 [2021-06-05 21:42:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:50,571 INFO L482 AbstractCegarLoop]: Abstraction has 115 states and 328 transitions. [2021-06-05 21:42:50,571 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 328 transitions. [2021-06-05 21:42:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:50,571 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:50,571 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:50,772 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:50,772 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:50,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:50,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1323878784, now seen corresponding path program 26 times [2021-06-05 21:42:50,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:50,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920287811] [2021-06-05 21:42:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:50,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:50,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920287811] [2021-06-05 21:42:50,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920287811] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:50,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299095920] [2021-06-05 21:42:50,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:50,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:50,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:50,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:50,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:50,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299095920] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:50,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:50,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:42:50,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406452922] [2021-06-05 21:42:50,968 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:42:50,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:42:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:42:50,969 INFO L87 Difference]: Start difference. First operand 115 states and 328 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:51,220 INFO L93 Difference]: Finished difference Result 234 states and 644 transitions. [2021-06-05 21:42:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:51,220 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:51,221 INFO L225 Difference]: With dead ends: 234 [2021-06-05 21:42:51,221 INFO L226 Difference]: Without dead ends: 229 [2021-06-05 21:42:51,221 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 214.1ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:42:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-06-05 21:42:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 117. [2021-06-05 21:42:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.896551724137931) internal successors, (336), 116 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 336 transitions. [2021-06-05 21:42:51,224 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 336 transitions. Word has length 15 [2021-06-05 21:42:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:51,224 INFO L482 AbstractCegarLoop]: Abstraction has 117 states and 336 transitions. [2021-06-05 21:42:51,224 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 336 transitions. [2021-06-05 21:42:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:51,225 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:51,225 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:51,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:51,436 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 37677322, now seen corresponding path program 27 times [2021-06-05 21:42:51,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:51,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548588527] [2021-06-05 21:42:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:51,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:51,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548588527] [2021-06-05 21:42:51,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548588527] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:51,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137474213] [2021-06-05 21:42:51,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:51,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:51,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:51,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:51,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:51,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137474213] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:51,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:51,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:42:51,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875739776] [2021-06-05 21:42:51,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:42:51,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:42:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:42:51,646 INFO L87 Difference]: Start difference. First operand 117 states and 336 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:51,894 INFO L93 Difference]: Finished difference Result 207 states and 572 transitions. [2021-06-05 21:42:51,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:51,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:51,896 INFO L225 Difference]: With dead ends: 207 [2021-06-05 21:42:51,896 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 21:42:51,896 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 227.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:42:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 21:42:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 113. [2021-06-05 21:42:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.875) internal successors, (322), 112 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 322 transitions. [2021-06-05 21:42:51,901 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 322 transitions. Word has length 15 [2021-06-05 21:42:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:51,901 INFO L482 AbstractCegarLoop]: Abstraction has 113 states and 322 transitions. [2021-06-05 21:42:51,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 322 transitions. [2021-06-05 21:42:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:51,902 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:51,902 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:52,121 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2021-06-05 21:42:52,122 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1830225050, now seen corresponding path program 28 times [2021-06-05 21:42:52,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:52,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209588843] [2021-06-05 21:42:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:52,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:52,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209588843] [2021-06-05 21:42:52,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209588843] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:52,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300102414] [2021-06-05 21:42:52,181 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:52,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:52,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:52,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:52,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:52,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300102414] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:52,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:52,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:42:52,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770247591] [2021-06-05 21:42:52,312 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:42:52,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:42:52,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:42:52,313 INFO L87 Difference]: Start difference. First operand 113 states and 322 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:52,501 INFO L93 Difference]: Finished difference Result 185 states and 511 transitions. [2021-06-05 21:42:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:52,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:52,502 INFO L225 Difference]: With dead ends: 185 [2021-06-05 21:42:52,502 INFO L226 Difference]: Without dead ends: 180 [2021-06-05 21:42:52,502 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 182.8ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:42:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-06-05 21:42:52,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 117. [2021-06-05 21:42:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.913793103448276) internal successors, (338), 116 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 338 transitions. [2021-06-05 21:42:52,505 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 338 transitions. Word has length 15 [2021-06-05 21:42:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:52,505 INFO L482 AbstractCegarLoop]: Abstraction has 117 states and 338 transitions. [2021-06-05 21:42:52,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 338 transitions. [2021-06-05 21:42:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:52,512 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:52,512 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:52,729 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:52,730 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:52,730 INFO L82 PathProgramCache]: Analyzing trace with hash -468668944, now seen corresponding path program 29 times [2021-06-05 21:42:52,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:52,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802831987] [2021-06-05 21:42:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:52,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:52,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802831987] [2021-06-05 21:42:52,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802831987] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:52,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488257263] [2021-06-05 21:42:52,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:52,842 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:52,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:52,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:52,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:52,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488257263] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:52,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:52,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:42:52,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121647187] [2021-06-05 21:42:52,933 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:42:52,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:42:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:42:52,933 INFO L87 Difference]: Start difference. First operand 117 states and 338 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:53,175 INFO L93 Difference]: Finished difference Result 195 states and 528 transitions. [2021-06-05 21:42:53,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:53,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:53,176 INFO L225 Difference]: With dead ends: 195 [2021-06-05 21:42:53,176 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 21:42:53,176 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 228.3ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:42:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 21:42:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 115. [2021-06-05 21:42:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.8947368421052633) internal successors, (330), 114 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 330 transitions. [2021-06-05 21:42:53,179 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 330 transitions. Word has length 15 [2021-06-05 21:42:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:53,179 INFO L482 AbstractCegarLoop]: Abstraction has 115 states and 330 transitions. [2021-06-05 21:42:53,179 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 330 transitions. [2021-06-05 21:42:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 21:42:53,179 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:53,179 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:53,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable177 [2021-06-05 21:42:53,393 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1003898746, now seen corresponding path program 30 times [2021-06-05 21:42:53,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:53,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091009352] [2021-06-05 21:42:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:53,446 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:53,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091009352] [2021-06-05 21:42:53,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091009352] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:53,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915043414] [2021-06-05 21:42:53,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:53,484 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:53,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:53,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 21:42:53,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:53,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915043414] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:53,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:53,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:42:53,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623572029] [2021-06-05 21:42:53,559 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:53,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:53,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:53,560 INFO L87 Difference]: Start difference. First operand 115 states and 330 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:53,787 INFO L93 Difference]: Finished difference Result 166 states and 460 transitions. [2021-06-05 21:42:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 21:42:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:53,788 INFO L225 Difference]: With dead ends: 166 [2021-06-05 21:42:53,788 INFO L226 Difference]: Without dead ends: 159 [2021-06-05 21:42:53,788 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 187.5ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-06-05 21:42:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2021-06-05 21:42:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.875) internal successors, (322), 112 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 322 transitions. [2021-06-05 21:42:53,791 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 322 transitions. Word has length 15 [2021-06-05 21:42:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:53,791 INFO L482 AbstractCegarLoop]: Abstraction has 113 states and 322 transitions. [2021-06-05 21:42:53,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 322 transitions. [2021-06-05 21:42:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:53,792 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:53,792 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:53,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable182 [2021-06-05 21:42:53,992 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash -639898996, now seen corresponding path program 1 times [2021-06-05 21:42:53,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:53,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249738389] [2021-06-05 21:42:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:54,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:54,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249738389] [2021-06-05 21:42:54,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249738389] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:54,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877077771] [2021-06-05 21:42:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:54,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:54,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:54,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877077771] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:54,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:54,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:42:54,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656336515] [2021-06-05 21:42:54,101 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:42:54,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:54,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:42:54,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:42:54,102 INFO L87 Difference]: Start difference. First operand 113 states and 322 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:54,193 INFO L93 Difference]: Finished difference Result 186 states and 521 transitions. [2021-06-05 21:42:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:54,194 INFO L225 Difference]: With dead ends: 186 [2021-06-05 21:42:54,194 INFO L226 Difference]: Without dead ends: 186 [2021-06-05 21:42:54,195 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-06-05 21:42:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 126. [2021-06-05 21:42:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.992) internal successors, (374), 125 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 374 transitions. [2021-06-05 21:42:54,197 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 374 transitions. Word has length 16 [2021-06-05 21:42:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:54,197 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 374 transitions. [2021-06-05 21:42:54,197 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 374 transitions. [2021-06-05 21:42:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:54,198 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:54,198 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:54,398 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:54,398 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:54,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:54,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1991072770, now seen corresponding path program 1 times [2021-06-05 21:42:54,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:54,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943933311] [2021-06-05 21:42:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:54,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:54,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943933311] [2021-06-05 21:42:54,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943933311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:54,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998092822] [2021-06-05 21:42:54,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:54,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:54,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:54,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998092822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:54,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:54,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:54,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018951650] [2021-06-05 21:42:54,518 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:54,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:54,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:54,518 INFO L87 Difference]: Start difference. First operand 126 states and 374 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:54,616 INFO L93 Difference]: Finished difference Result 163 states and 462 transitions. [2021-06-05 21:42:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:54,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:54,617 INFO L225 Difference]: With dead ends: 163 [2021-06-05 21:42:54,617 INFO L226 Difference]: Without dead ends: 153 [2021-06-05 21:42:54,617 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 82.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-06-05 21:42:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 126. [2021-06-05 21:42:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.952) internal successors, (369), 125 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 369 transitions. [2021-06-05 21:42:54,620 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 369 transitions. Word has length 16 [2021-06-05 21:42:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:54,620 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 369 transitions. [2021-06-05 21:42:54,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 369 transitions. [2021-06-05 21:42:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:54,621 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:54,621 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:54,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable188 [2021-06-05 21:42:54,821 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1652532542, now seen corresponding path program 2 times [2021-06-05 21:42:54,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:54,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008667367] [2021-06-05 21:42:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:54,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:54,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008667367] [2021-06-05 21:42:54,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008667367] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:54,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607020778] [2021-06-05 21:42:54,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:54,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:54,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:54,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:54,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:54,935 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607020778] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:54,935 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:54,935 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:54,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539987720] [2021-06-05 21:42:54,935 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:54,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:54,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:54,936 INFO L87 Difference]: Start difference. First operand 126 states and 369 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:55,031 INFO L93 Difference]: Finished difference Result 193 states and 538 transitions. [2021-06-05 21:42:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:55,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:55,032 INFO L225 Difference]: With dead ends: 193 [2021-06-05 21:42:55,033 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 21:42:55,033 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 21:42:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 129. [2021-06-05 21:42:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 384 transitions. [2021-06-05 21:42:55,035 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 384 transitions. Word has length 16 [2021-06-05 21:42:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:55,035 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 384 transitions. [2021-06-05 21:42:55,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 384 transitions. [2021-06-05 21:42:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:55,035 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:55,035 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:55,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:55,236 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1447398580, now seen corresponding path program 2 times [2021-06-05 21:42:55,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:55,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305690069] [2021-06-05 21:42:55,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:55,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:55,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305690069] [2021-06-05 21:42:55,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305690069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:55,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775590396] [2021-06-05 21:42:55,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:55,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:55,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:55,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:55,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:55,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775590396] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:55,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:55,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:42:55,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462246293] [2021-06-05 21:42:55,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:55,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:55,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:55,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:55,359 INFO L87 Difference]: Start difference. First operand 129 states and 384 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:55,448 INFO L93 Difference]: Finished difference Result 180 states and 505 transitions. [2021-06-05 21:42:55,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:55,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:55,449 INFO L225 Difference]: With dead ends: 180 [2021-06-05 21:42:55,450 INFO L226 Difference]: Without dead ends: 176 [2021-06-05 21:42:55,450 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 80.9ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:42:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-06-05 21:42:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2021-06-05 21:42:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9925925925925925) internal successors, (404), 135 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 404 transitions. [2021-06-05 21:42:55,452 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 404 transitions. Word has length 16 [2021-06-05 21:42:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:55,453 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 404 transitions. [2021-06-05 21:42:55,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 404 transitions. [2021-06-05 21:42:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:55,453 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:55,453 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:55,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:55,667 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash -18443474, now seen corresponding path program 3 times [2021-06-05 21:42:55,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:55,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739824035] [2021-06-05 21:42:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:55,698 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:55,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739824035] [2021-06-05 21:42:55,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739824035] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:55,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681710377] [2021-06-05 21:42:55,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:55,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:55,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:55,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:55,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:55,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681710377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:55,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:55,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:55,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129343994] [2021-06-05 21:42:55,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:55,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:55,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:55,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:55,775 INFO L87 Difference]: Start difference. First operand 136 states and 404 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:55,887 INFO L93 Difference]: Finished difference Result 176 states and 499 transitions. [2021-06-05 21:42:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:55,888 INFO L225 Difference]: With dead ends: 176 [2021-06-05 21:42:55,888 INFO L226 Difference]: Without dead ends: 173 [2021-06-05 21:42:55,888 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 67.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-06-05 21:42:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2021-06-05 21:42:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9703703703703703) internal successors, (401), 135 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 401 transitions. [2021-06-05 21:42:55,894 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 401 transitions. Word has length 16 [2021-06-05 21:42:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:55,894 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 401 transitions. [2021-06-05 21:42:55,894 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 401 transitions. [2021-06-05 21:42:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:55,895 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:55,895 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:56,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:56,105 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:56,105 INFO L82 PathProgramCache]: Analyzing trace with hash 907579970, now seen corresponding path program 3 times [2021-06-05 21:42:56,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:56,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063787194] [2021-06-05 21:42:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:56,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:56,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063787194] [2021-06-05 21:42:56,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063787194] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:56,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545736295] [2021-06-05 21:42:56,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:56,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:42:56,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:56,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:56,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:56,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545736295] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:56,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:56,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:42:56,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090803134] [2021-06-05 21:42:56,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:56,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:56,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:56,233 INFO L87 Difference]: Start difference. First operand 136 states and 401 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:56,351 INFO L93 Difference]: Finished difference Result 162 states and 468 transitions. [2021-06-05 21:42:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:56,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:56,352 INFO L225 Difference]: With dead ends: 162 [2021-06-05 21:42:56,352 INFO L226 Difference]: Without dead ends: 162 [2021-06-05 21:42:56,352 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:42:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-06-05 21:42:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2021-06-05 21:42:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.9770992366412212) internal successors, (390), 131 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 390 transitions. [2021-06-05 21:42:56,354 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 390 transitions. Word has length 16 [2021-06-05 21:42:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:56,354 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 390 transitions. [2021-06-05 21:42:56,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 390 transitions. [2021-06-05 21:42:56,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:56,355 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:56,355 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:56,572 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:56,573 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash -408327260, now seen corresponding path program 4 times [2021-06-05 21:42:56,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:56,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994352567] [2021-06-05 21:42:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:56,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:56,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994352567] [2021-06-05 21:42:56,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994352567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:56,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760895282] [2021-06-05 21:42:56,607 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:56,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:56,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:56,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:56,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:56,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760895282] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:56,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:56,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:42:56,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128455516] [2021-06-05 21:42:56,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:56,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:56,694 INFO L87 Difference]: Start difference. First operand 132 states and 390 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:56,790 INFO L93 Difference]: Finished difference Result 192 states and 545 transitions. [2021-06-05 21:42:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:56,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:56,791 INFO L225 Difference]: With dead ends: 192 [2021-06-05 21:42:56,791 INFO L226 Difference]: Without dead ends: 192 [2021-06-05 21:42:56,791 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:42:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-06-05 21:42:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2021-06-05 21:42:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0437956204379564) internal successors, (417), 137 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 417 transitions. [2021-06-05 21:42:56,794 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 417 transitions. Word has length 16 [2021-06-05 21:42:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:56,794 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 417 transitions. [2021-06-05 21:42:56,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 417 transitions. [2021-06-05 21:42:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:56,795 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:56,795 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:57,011 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2021-06-05 21:42:57,011 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:57,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash 786708914, now seen corresponding path program 4 times [2021-06-05 21:42:57,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:57,012 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346558655] [2021-06-05 21:42:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:57,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:57,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346558655] [2021-06-05 21:42:57,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346558655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:57,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637674474] [2021-06-05 21:42:57,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:57,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:42:57,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:57,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:57,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:57,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637674474] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:57,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:57,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:57,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252438940] [2021-06-05 21:42:57,126 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:57,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:57,126 INFO L87 Difference]: Start difference. First operand 138 states and 417 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:57,238 INFO L93 Difference]: Finished difference Result 198 states and 562 transitions. [2021-06-05 21:42:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:57,240 INFO L225 Difference]: With dead ends: 198 [2021-06-05 21:42:57,240 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 21:42:57,240 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 21:42:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 148. [2021-06-05 21:42:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.054421768707483) internal successors, (449), 147 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 449 transitions. [2021-06-05 21:42:57,243 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 449 transitions. Word has length 16 [2021-06-05 21:42:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:57,244 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 449 transitions. [2021-06-05 21:42:57,244 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 449 transitions. [2021-06-05 21:42:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:57,244 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:57,244 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:57,464 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable200 [2021-06-05 21:42:57,465 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:57,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:57,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2079303276, now seen corresponding path program 5 times [2021-06-05 21:42:57,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:57,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480838197] [2021-06-05 21:42:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:57,495 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:57,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480838197] [2021-06-05 21:42:57,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480838197] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:57,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398223738] [2021-06-05 21:42:57,495 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:57,523 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:57,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:57,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:57,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:57,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398223738] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:57,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:57,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:42:57,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688268636] [2021-06-05 21:42:57,585 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:57,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:57,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:57,586 INFO L87 Difference]: Start difference. First operand 148 states and 449 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:57,673 INFO L93 Difference]: Finished difference Result 201 states and 572 transitions. [2021-06-05 21:42:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:57,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:57,674 INFO L225 Difference]: With dead ends: 201 [2021-06-05 21:42:57,675 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 21:42:57,675 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 78.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:42:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 21:42:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 148. [2021-06-05 21:42:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.0340136054421767) internal successors, (446), 147 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 446 transitions. [2021-06-05 21:42:57,678 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 446 transitions. Word has length 16 [2021-06-05 21:42:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:57,678 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 446 transitions. [2021-06-05 21:42:57,678 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 446 transitions. [2021-06-05 21:42:57,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:57,679 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:57,679 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:57,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable203 [2021-06-05 21:42:57,885 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1153279832, now seen corresponding path program 5 times [2021-06-05 21:42:57,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:57,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968214942] [2021-06-05 21:42:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:57,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:57,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968214942] [2021-06-05 21:42:57,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968214942] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:57,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473347377] [2021-06-05 21:42:57,923 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:57,959 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:42:57,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:57,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:57,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:58,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473347377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:58,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:58,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:58,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627199180] [2021-06-05 21:42:58,009 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:58,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:58,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:58,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:58,010 INFO L87 Difference]: Start difference. First operand 148 states and 446 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:58,106 INFO L93 Difference]: Finished difference Result 200 states and 570 transitions. [2021-06-05 21:42:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:58,107 INFO L225 Difference]: With dead ends: 200 [2021-06-05 21:42:58,107 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 21:42:58,107 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 21:42:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2021-06-05 21:42:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0347222222222223) internal successors, (437), 144 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 437 transitions. [2021-06-05 21:42:58,110 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 437 transitions. Word has length 16 [2021-06-05 21:42:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:58,111 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 437 transitions. [2021-06-05 21:42:58,111 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 437 transitions. [2021-06-05 21:42:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:58,111 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:58,111 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:58,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable206 [2021-06-05 21:42:58,317 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1341923340, now seen corresponding path program 6 times [2021-06-05 21:42:58,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:58,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512521121] [2021-06-05 21:42:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:58,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:58,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512521121] [2021-06-05 21:42:58,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512521121] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:58,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592596390] [2021-06-05 21:42:58,352 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:58,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:58,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:58,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:58,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:58,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592596390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:58,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:58,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:42:58,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161883556] [2021-06-05 21:42:58,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:42:58,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:58,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:42:58,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:42:58,446 INFO L87 Difference]: Start difference. First operand 145 states and 437 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:58,541 INFO L93 Difference]: Finished difference Result 178 states and 518 transitions. [2021-06-05 21:42:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:58,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:58,542 INFO L225 Difference]: With dead ends: 178 [2021-06-05 21:42:58,542 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 21:42:58,543 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 75.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 21:42:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2021-06-05 21:42:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.013888888888889) internal successors, (434), 144 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 434 transitions. [2021-06-05 21:42:58,545 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 434 transitions. Word has length 16 [2021-06-05 21:42:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:58,546 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 434 transitions. [2021-06-05 21:42:58,546 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 434 transitions. [2021-06-05 21:42:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:58,546 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:58,546 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:58,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:58,761 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1171713858, now seen corresponding path program 6 times [2021-06-05 21:42:58,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:58,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77849669] [2021-06-05 21:42:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:58,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:58,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77849669] [2021-06-05 21:42:58,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77849669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:58,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030040895] [2021-06-05 21:42:58,795 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:58,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:42:58,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:42:58,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:58,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:58,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030040895] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:58,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:58,878 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:42:58,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624100529] [2021-06-05 21:42:58,878 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:42:58,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:42:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:42:58,878 INFO L87 Difference]: Start difference. First operand 145 states and 434 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:58,968 INFO L93 Difference]: Finished difference Result 200 states and 574 transitions. [2021-06-05 21:42:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:58,969 INFO L225 Difference]: With dead ends: 200 [2021-06-05 21:42:58,969 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 21:42:58,969 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 67.5ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:42:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 21:42:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 138. [2021-06-05 21:42:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0) internal successors, (411), 137 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 411 transitions. [2021-06-05 21:42:58,972 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 411 transitions. Word has length 16 [2021-06-05 21:42:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:58,972 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 411 transitions. [2021-06-05 21:42:58,972 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 411 transitions. [2021-06-05 21:42:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:58,973 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:58,973 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:59,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable210 [2021-06-05 21:42:59,185 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash 228804358, now seen corresponding path program 7 times [2021-06-05 21:42:59,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:59,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295104597] [2021-06-05 21:42:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:59,216 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:59,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295104597] [2021-06-05 21:42:59,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295104597] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:59,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11302857] [2021-06-05 21:42:59,216 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:59,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:59,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:59,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11302857] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:59,280 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:59,280 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:42:59,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217717570] [2021-06-05 21:42:59,280 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:42:59,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:42:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:42:59,280 INFO L87 Difference]: Start difference. First operand 138 states and 411 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:59,362 INFO L93 Difference]: Finished difference Result 314 states and 911 transitions. [2021-06-05 21:42:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:59,364 INFO L225 Difference]: With dead ends: 314 [2021-06-05 21:42:59,364 INFO L226 Difference]: Without dead ends: 314 [2021-06-05 21:42:59,364 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:42:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-06-05 21:42:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 152. [2021-06-05 21:42:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0927152317880795) internal successors, (467), 151 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 467 transitions. [2021-06-05 21:42:59,367 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 467 transitions. Word has length 16 [2021-06-05 21:42:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:59,367 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 467 transitions. [2021-06-05 21:42:59,367 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 467 transitions. [2021-06-05 21:42:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:59,368 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:59,368 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:59,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:59,581 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:59,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1435191172, now seen corresponding path program 7 times [2021-06-05 21:42:59,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:59,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497648253] [2021-06-05 21:42:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:59,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:42:59,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497648253] [2021-06-05 21:42:59,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497648253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:59,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020242542] [2021-06-05 21:42:59,610 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:42:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:42:59,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:42:59,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:42:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:42:59,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020242542] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:42:59,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:42:59,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:42:59,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91544843] [2021-06-05 21:42:59,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:42:59,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:42:59,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:42:59,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:42:59,686 INFO L87 Difference]: Start difference. First operand 152 states and 467 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:42:59,761 INFO L93 Difference]: Finished difference Result 257 states and 727 transitions. [2021-06-05 21:42:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:42:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:42:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:42:59,762 INFO L225 Difference]: With dead ends: 257 [2021-06-05 21:42:59,762 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 21:42:59,762 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:42:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 21:42:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 152. [2021-06-05 21:42:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0596026490066226) internal successors, (462), 151 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 462 transitions. [2021-06-05 21:42:59,766 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 462 transitions. Word has length 16 [2021-06-05 21:42:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:42:59,766 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 462 transitions. [2021-06-05 21:42:59,766 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:42:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 462 transitions. [2021-06-05 21:42:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:42:59,766 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:42:59,766 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:42:59,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable212 [2021-06-05 21:42:59,981 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:42:59,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:42:59,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1773731400, now seen corresponding path program 8 times [2021-06-05 21:42:59,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:42:59,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838929623] [2021-06-05 21:42:59,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:42:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:00,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:00,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838929623] [2021-06-05 21:43:00,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838929623] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:00,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127848520] [2021-06-05 21:43:00,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:00,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:00,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:00,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:00,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:00,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127848520] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:00,087 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:00,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:00,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305565176] [2021-06-05 21:43:00,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:00,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:00,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:00,087 INFO L87 Difference]: Start difference. First operand 152 states and 462 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:00,179 INFO L93 Difference]: Finished difference Result 311 states and 888 transitions. [2021-06-05 21:43:00,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:00,181 INFO L225 Difference]: With dead ends: 311 [2021-06-05 21:43:00,181 INFO L226 Difference]: Without dead ends: 311 [2021-06-05 21:43:00,181 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-06-05 21:43:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 158. [2021-06-05 21:43:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.1337579617834397) internal successors, (492), 157 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 492 transitions. [2021-06-05 21:43:00,183 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 492 transitions. Word has length 16 [2021-06-05 21:43:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:00,184 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 492 transitions. [2021-06-05 21:43:00,184 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 492 transitions. [2021-06-05 21:43:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:00,184 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:00,184 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:00,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215,60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:00,388 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash -578695226, now seen corresponding path program 8 times [2021-06-05 21:43:00,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:00,388 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665429484] [2021-06-05 21:43:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:00,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:00,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665429484] [2021-06-05 21:43:00,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665429484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:00,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396707231] [2021-06-05 21:43:00,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:00,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:00,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:00,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:00,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:00,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396707231] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:00,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:00,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:00,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653417649] [2021-06-05 21:43:00,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:00,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:00,535 INFO L87 Difference]: Start difference. First operand 158 states and 492 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:00,614 INFO L93 Difference]: Finished difference Result 283 states and 806 transitions. [2021-06-05 21:43:00,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:00,615 INFO L225 Difference]: With dead ends: 283 [2021-06-05 21:43:00,615 INFO L226 Difference]: Without dead ends: 279 [2021-06-05 21:43:00,615 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 88.5ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-06-05 21:43:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 165. [2021-06-05 21:43:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.1219512195121952) internal successors, (512), 164 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 512 transitions. [2021-06-05 21:43:00,618 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 512 transitions. Word has length 16 [2021-06-05 21:43:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:00,618 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 512 transitions. [2021-06-05 21:43:00,618 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 512 transitions. [2021-06-05 21:43:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:00,619 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:00,619 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:00,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable216 [2021-06-05 21:43:00,833 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 850259880, now seen corresponding path program 9 times [2021-06-05 21:43:00,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:00,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877009284] [2021-06-05 21:43:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:00,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:00,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877009284] [2021-06-05 21:43:00,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877009284] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:00,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776322308] [2021-06-05 21:43:00,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:00,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:43:00,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:00,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:00,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:00,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776322308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:00,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:00,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:00,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999290346] [2021-06-05 21:43:00,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:00,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:00,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:00,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:00,939 INFO L87 Difference]: Start difference. First operand 165 states and 512 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:01,025 INFO L93 Difference]: Finished difference Result 294 states and 846 transitions. [2021-06-05 21:43:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:01,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:01,026 INFO L225 Difference]: With dead ends: 294 [2021-06-05 21:43:01,027 INFO L226 Difference]: Without dead ends: 291 [2021-06-05 21:43:01,027 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 60.0ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-06-05 21:43:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 168. [2021-06-05 21:43:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 3.0838323353293413) internal successors, (515), 167 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 515 transitions. [2021-06-05 21:43:01,030 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 515 transitions. Word has length 16 [2021-06-05 21:43:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:01,030 INFO L482 AbstractCegarLoop]: Abstraction has 168 states and 515 transitions. [2021-06-05 21:43:01,030 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 515 transitions. [2021-06-05 21:43:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:01,031 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:01,031 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:01,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:01,249 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:01,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:01,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1776283324, now seen corresponding path program 9 times [2021-06-05 21:43:01,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:01,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736399771] [2021-06-05 21:43:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:01,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:01,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736399771] [2021-06-05 21:43:01,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736399771] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:01,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329882653] [2021-06-05 21:43:01,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:01,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:43:01,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:01,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:01,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:01,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329882653] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:01,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:01,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:01,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015430286] [2021-06-05 21:43:01,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:01,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:01,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:01,398 INFO L87 Difference]: Start difference. First operand 168 states and 515 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:01,494 INFO L93 Difference]: Finished difference Result 271 states and 781 transitions. [2021-06-05 21:43:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:01,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:01,495 INFO L225 Difference]: With dead ends: 271 [2021-06-05 21:43:01,495 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 21:43:01,495 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 90.3ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 21:43:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2021-06-05 21:43:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0789473684210527) internal successors, (468), 152 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 468 transitions. [2021-06-05 21:43:01,498 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 468 transitions. Word has length 16 [2021-06-05 21:43:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:01,498 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 468 transitions. [2021-06-05 21:43:01,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 468 transitions. [2021-06-05 21:43:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:01,498 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:01,498 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:01,699 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable222 [2021-06-05 21:43:01,699 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:01,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2036008658, now seen corresponding path program 10 times [2021-06-05 21:43:01,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:01,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898080413] [2021-06-05 21:43:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:43:01,752 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:01,752 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898080413] [2021-06-05 21:43:01,752 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898080413] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:01,752 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014949674] [2021-06-05 21:43:01,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:01,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:43:01,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:01,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:01,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:01,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014949674] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:01,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:01,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:43:01,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626459] [2021-06-05 21:43:01,850 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:01,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:01,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:01,850 INFO L87 Difference]: Start difference. First operand 153 states and 468 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:02,186 INFO L93 Difference]: Finished difference Result 308 states and 874 transitions. [2021-06-05 21:43:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:43:02,186 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:02,187 INFO L225 Difference]: With dead ends: 308 [2021-06-05 21:43:02,187 INFO L226 Difference]: Without dead ends: 298 [2021-06-05 21:43:02,187 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 286.5ms TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:43:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-06-05 21:43:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 143. [2021-06-05 21:43:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.035211267605634) internal successors, (431), 142 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 431 transitions. [2021-06-05 21:43:02,189 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 431 transitions. Word has length 16 [2021-06-05 21:43:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:02,190 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 431 transitions. [2021-06-05 21:43:02,190 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 431 transitions. [2021-06-05 21:43:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:02,190 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:02,190 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:02,390 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:02,390 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1350168710, now seen corresponding path program 10 times [2021-06-05 21:43:02,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:02,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893009141] [2021-06-05 21:43:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:02,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:02,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893009141] [2021-06-05 21:43:02,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893009141] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:02,423 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:02,423 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:02,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606324883] [2021-06-05 21:43:02,423 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:02,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:02,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:02,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:02,423 INFO L87 Difference]: Start difference. First operand 143 states and 431 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:02,519 INFO L93 Difference]: Finished difference Result 204 states and 571 transitions. [2021-06-05 21:43:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:02,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:02,520 INFO L225 Difference]: With dead ends: 204 [2021-06-05 21:43:02,520 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 21:43:02,520 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 21:43:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 145. [2021-06-05 21:43:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0069444444444446) internal successors, (433), 144 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 433 transitions. [2021-06-05 21:43:02,522 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 433 transitions. Word has length 16 [2021-06-05 21:43:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:02,523 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 433 transitions. [2021-06-05 21:43:02,523 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 433 transitions. [2021-06-05 21:43:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:02,523 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:02,523 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:02,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-06-05 21:43:02,523 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:02,524 INFO L82 PathProgramCache]: Analyzing trace with hash -474092858, now seen corresponding path program 11 times [2021-06-05 21:43:02,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:02,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964525229] [2021-06-05 21:43:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:02,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:02,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964525229] [2021-06-05 21:43:02,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964525229] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:02,553 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:02,553 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:02,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001160441] [2021-06-05 21:43:02,553 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:02,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:02,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:02,554 INFO L87 Difference]: Start difference. First operand 145 states and 433 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:02,656 INFO L93 Difference]: Finished difference Result 197 states and 551 transitions. [2021-06-05 21:43:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:02,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:02,658 INFO L225 Difference]: With dead ends: 197 [2021-06-05 21:43:02,658 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 21:43:02,658 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 82.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 21:43:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 151. [2021-06-05 21:43:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.966666666666667) internal successors, (445), 150 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 445 transitions. [2021-06-05 21:43:02,661 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 445 transitions. Word has length 16 [2021-06-05 21:43:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:02,661 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 445 transitions. [2021-06-05 21:43:02,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 445 transitions. [2021-06-05 21:43:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:02,661 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:02,661 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:02,661 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-06-05 21:43:02,662 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash -547465338, now seen corresponding path program 12 times [2021-06-05 21:43:02,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:02,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071060817] [2021-06-05 21:43:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:02,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:02,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071060817] [2021-06-05 21:43:02,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071060817] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:02,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:02,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:02,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421710248] [2021-06-05 21:43:02,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:02,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:02,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:02,700 INFO L87 Difference]: Start difference. First operand 151 states and 445 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:02,793 INFO L93 Difference]: Finished difference Result 182 states and 529 transitions. [2021-06-05 21:43:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:02,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:02,794 INFO L225 Difference]: With dead ends: 182 [2021-06-05 21:43:02,794 INFO L226 Difference]: Without dead ends: 177 [2021-06-05 21:43:02,794 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-06-05 21:43:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2021-06-05 21:43:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.0211267605633805) internal successors, (429), 142 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 429 transitions. [2021-06-05 21:43:02,796 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 429 transitions. Word has length 16 [2021-06-05 21:43:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:02,796 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 429 transitions. [2021-06-05 21:43:02,796 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 429 transitions. [2021-06-05 21:43:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:02,796 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:02,797 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:02,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-06-05 21:43:02,797 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1766834084, now seen corresponding path program 11 times [2021-06-05 21:43:02,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:02,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088674170] [2021-06-05 21:43:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:02,857 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:02,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088674170] [2021-06-05 21:43:02,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088674170] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:02,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380326880] [2021-06-05 21:43:02,857 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:02,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:02,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:02,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:02,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:02,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380326880] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:02,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:02,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 21:43:02,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686788591] [2021-06-05 21:43:02,963 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 21:43:02,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 21:43:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:02,963 INFO L87 Difference]: Start difference. First operand 143 states and 429 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:03,179 INFO L93 Difference]: Finished difference Result 259 states and 737 transitions. [2021-06-05 21:43:03,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:03,180 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:03,181 INFO L225 Difference]: With dead ends: 259 [2021-06-05 21:43:03,181 INFO L226 Difference]: Without dead ends: 259 [2021-06-05 21:43:03,181 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 187.7ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:43:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-06-05 21:43:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 151. [2021-06-05 21:43:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 3.1266666666666665) internal successors, (469), 150 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 469 transitions. [2021-06-05 21:43:03,185 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 469 transitions. Word has length 16 [2021-06-05 21:43:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:03,185 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 469 transitions. [2021-06-05 21:43:03,185 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 469 transitions. [2021-06-05 21:43:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:03,185 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:03,185 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:03,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable227 [2021-06-05 21:43:03,386 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1333097038, now seen corresponding path program 13 times [2021-06-05 21:43:03,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:03,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824445062] [2021-06-05 21:43:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:03,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:03,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824445062] [2021-06-05 21:43:03,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824445062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:03,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343824932] [2021-06-05 21:43:03,419 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:03,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:03,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:03,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343824932] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:03,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:03,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:03,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9709684] [2021-06-05 21:43:03,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:03,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:03,514 INFO L87 Difference]: Start difference. First operand 151 states and 469 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:03,633 INFO L93 Difference]: Finished difference Result 245 states and 702 transitions. [2021-06-05 21:43:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:03,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:03,641 INFO L225 Difference]: With dead ends: 245 [2021-06-05 21:43:03,641 INFO L226 Difference]: Without dead ends: 241 [2021-06-05 21:43:03,642 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-06-05 21:43:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 159. [2021-06-05 21:43:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.1265822784810124) internal successors, (494), 158 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 494 transitions. [2021-06-05 21:43:03,658 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 494 transitions. Word has length 16 [2021-06-05 21:43:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:03,658 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 494 transitions. [2021-06-05 21:43:03,658 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 494 transitions. [2021-06-05 21:43:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:03,658 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:03,658 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:03,892 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable228 [2021-06-05 21:43:03,893 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 95858068, now seen corresponding path program 12 times [2021-06-05 21:43:03,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:03,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159976440] [2021-06-05 21:43:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:03,975 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:03,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159976440] [2021-06-05 21:43:03,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159976440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:03,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896660668] [2021-06-05 21:43:03,976 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:04,020 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:04,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:04,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:04,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:04,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896660668] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:04,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:04,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 21:43:04,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075336037] [2021-06-05 21:43:04,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 21:43:04,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 21:43:04,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:04,125 INFO L87 Difference]: Start difference. First operand 159 states and 494 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:04,313 INFO L93 Difference]: Finished difference Result 256 states and 722 transitions. [2021-06-05 21:43:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:04,314 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:04,315 INFO L225 Difference]: With dead ends: 256 [2021-06-05 21:43:04,315 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 21:43:04,315 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 206.7ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:43:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 21:43:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 162. [2021-06-05 21:43:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 3.0869565217391304) internal successors, (497), 161 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 497 transitions. [2021-06-05 21:43:04,318 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 497 transitions. Word has length 16 [2021-06-05 21:43:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:04,319 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 497 transitions. [2021-06-05 21:43:04,319 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 497 transitions. [2021-06-05 21:43:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:04,319 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:04,319 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:04,532 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231,67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:04,533 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:04,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:04,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1021881512, now seen corresponding path program 14 times [2021-06-05 21:43:04,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:04,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161506812] [2021-06-05 21:43:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:04,577 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:04,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161506812] [2021-06-05 21:43:04,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161506812] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:04,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110173041] [2021-06-05 21:43:04,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:04,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:04,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:04,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:04,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:04,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110173041] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:04,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:04,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:04,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432755052] [2021-06-05 21:43:04,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:04,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:04,680 INFO L87 Difference]: Start difference. First operand 162 states and 497 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:04,785 INFO L93 Difference]: Finished difference Result 260 states and 746 transitions. [2021-06-05 21:43:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:04,793 INFO L225 Difference]: With dead ends: 260 [2021-06-05 21:43:04,793 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 21:43:04,793 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.7ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 21:43:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 159. [2021-06-05 21:43:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.088607594936709) internal successors, (488), 158 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 488 transitions. [2021-06-05 21:43:04,795 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 488 transitions. Word has length 16 [2021-06-05 21:43:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:04,795 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 488 transitions. [2021-06-05 21:43:04,795 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 488 transitions. [2021-06-05 21:43:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:04,796 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:04,796 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:04,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable234 [2021-06-05 21:43:04,996 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2109417596, now seen corresponding path program 13 times [2021-06-05 21:43:04,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:04,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90063127] [2021-06-05 21:43:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:05,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:05,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90063127] [2021-06-05 21:43:05,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90063127] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:05,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326164474] [2021-06-05 21:43:05,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:05,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:05,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:05,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326164474] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:05,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:05,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:05,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658535702] [2021-06-05 21:43:05,103 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:05,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:05,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:05,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:05,103 INFO L87 Difference]: Start difference. First operand 159 states and 488 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:05,207 INFO L93 Difference]: Finished difference Result 256 states and 720 transitions. [2021-06-05 21:43:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:05,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:05,209 INFO L225 Difference]: With dead ends: 256 [2021-06-05 21:43:05,209 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 21:43:05,209 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 66.9ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 21:43:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 154. [2021-06-05 21:43:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.0718954248366015) internal successors, (470), 153 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 470 transitions. [2021-06-05 21:43:05,212 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 470 transitions. Word has length 16 [2021-06-05 21:43:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:05,212 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 470 transitions. [2021-06-05 21:43:05,212 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 470 transitions. [2021-06-05 21:43:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:05,213 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:05,213 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:05,413 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable235 [2021-06-05 21:43:05,414 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash -213836346, now seen corresponding path program 14 times [2021-06-05 21:43:05,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:05,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089281157] [2021-06-05 21:43:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:05,448 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:05,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089281157] [2021-06-05 21:43:05,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089281157] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:05,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602653344] [2021-06-05 21:43:05,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:05,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:05,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:05,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:05,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:05,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602653344] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:05,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:05,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:05,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872411444] [2021-06-05 21:43:05,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:05,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:05,528 INFO L87 Difference]: Start difference. First operand 154 states and 470 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:05,606 INFO L93 Difference]: Finished difference Result 234 states and 666 transitions. [2021-06-05 21:43:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:05,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:05,607 INFO L225 Difference]: With dead ends: 234 [2021-06-05 21:43:05,607 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 21:43:05,607 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 66.4ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 21:43:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2021-06-05 21:43:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0596026490066226) internal successors, (462), 151 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 462 transitions. [2021-06-05 21:43:05,610 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 462 transitions. Word has length 16 [2021-06-05 21:43:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:05,610 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 462 transitions. [2021-06-05 21:43:05,610 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 462 transitions. [2021-06-05 21:43:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:05,610 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:05,610 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:05,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:05,811 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:05,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2074530712, now seen corresponding path program 15 times [2021-06-05 21:43:05,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:05,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670337892] [2021-06-05 21:43:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:05,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:05,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670337892] [2021-06-05 21:43:05,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670337892] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:05,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:05,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:05,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55160564] [2021-06-05 21:43:05,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:05,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:05,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:05,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:05,848 INFO L87 Difference]: Start difference. First operand 152 states and 462 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:05,948 INFO L93 Difference]: Finished difference Result 229 states and 636 transitions. [2021-06-05 21:43:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:05,949 INFO L225 Difference]: With dead ends: 229 [2021-06-05 21:43:05,949 INFO L226 Difference]: Without dead ends: 225 [2021-06-05 21:43:05,949 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 76.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-06-05 21:43:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 154. [2021-06-05 21:43:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.045751633986928) internal successors, (466), 153 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 466 transitions. [2021-06-05 21:43:05,951 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 466 transitions. Word has length 16 [2021-06-05 21:43:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:05,951 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 466 transitions. [2021-06-05 21:43:05,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 466 transitions. [2021-06-05 21:43:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:05,952 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:05,952 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:05,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2021-06-05 21:43:05,952 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2147064104, now seen corresponding path program 16 times [2021-06-05 21:43:05,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:05,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427705672] [2021-06-05 21:43:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:05,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:05,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427705672] [2021-06-05 21:43:05,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427705672] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:05,988 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:05,988 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:05,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597183797] [2021-06-05 21:43:05,989 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:05,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:05,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:05,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:05,989 INFO L87 Difference]: Start difference. First operand 154 states and 466 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:06,111 INFO L93 Difference]: Finished difference Result 212 states and 610 transitions. [2021-06-05 21:43:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:06,112 INFO L225 Difference]: With dead ends: 212 [2021-06-05 21:43:06,112 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 21:43:06,112 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 21:43:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2021-06-05 21:43:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0460526315789473) internal successors, (463), 152 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 463 transitions. [2021-06-05 21:43:06,115 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 463 transitions. Word has length 16 [2021-06-05 21:43:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:06,115 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 463 transitions. [2021-06-05 21:43:06,115 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 463 transitions. [2021-06-05 21:43:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:06,115 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:06,115 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:06,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2021-06-05 21:43:06,116 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:06,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1481357318, now seen corresponding path program 15 times [2021-06-05 21:43:06,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:06,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437603115] [2021-06-05 21:43:06,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:06,146 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:06,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437603115] [2021-06-05 21:43:06,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437603115] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:06,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:06,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:06,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60214444] [2021-06-05 21:43:06,147 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:06,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:06,147 INFO L87 Difference]: Start difference. First operand 153 states and 463 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:06,221 INFO L93 Difference]: Finished difference Result 222 states and 625 transitions. [2021-06-05 21:43:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:06,222 INFO L225 Difference]: With dead ends: 222 [2021-06-05 21:43:06,222 INFO L226 Difference]: Without dead ends: 219 [2021-06-05 21:43:06,222 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-06-05 21:43:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 158. [2021-06-05 21:43:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0127388535031847) internal successors, (473), 157 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 473 transitions. [2021-06-05 21:43:06,225 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 473 transitions. Word has length 16 [2021-06-05 21:43:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:06,225 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 473 transitions. [2021-06-05 21:43:06,225 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 473 transitions. [2021-06-05 21:43:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:06,229 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:06,229 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:06,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-06-05 21:43:06,229 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash 384029742, now seen corresponding path program 16 times [2021-06-05 21:43:06,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:06,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429144211] [2021-06-05 21:43:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:06,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:06,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429144211] [2021-06-05 21:43:06,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429144211] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:06,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:06,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:06,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341737418] [2021-06-05 21:43:06,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:06,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:06,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:06,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:06,267 INFO L87 Difference]: Start difference. First operand 158 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:06,358 INFO L93 Difference]: Finished difference Result 209 states and 606 transitions. [2021-06-05 21:43:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:06,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:06,359 INFO L225 Difference]: With dead ends: 209 [2021-06-05 21:43:06,359 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 21:43:06,359 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 58.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 21:43:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 153. [2021-06-05 21:43:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.039473684210526) internal successors, (462), 152 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 462 transitions. [2021-06-05 21:43:06,361 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 462 transitions. Word has length 16 [2021-06-05 21:43:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:06,361 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 462 transitions. [2021-06-05 21:43:06,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 462 transitions. [2021-06-05 21:43:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:06,361 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:06,361 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:06,361 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2021-06-05 21:43:06,362 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1323363576, now seen corresponding path program 17 times [2021-06-05 21:43:06,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:06,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667578602] [2021-06-05 21:43:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:06,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:06,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667578602] [2021-06-05 21:43:06,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667578602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:06,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713655004] [2021-06-05 21:43:06,403 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:06,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:43:06,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:06,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:06,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:06,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713655004] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:06,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:06,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:06,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707171235] [2021-06-05 21:43:06,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:06,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:06,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:06,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:06,492 INFO L87 Difference]: Start difference. First operand 153 states and 462 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:06,577 INFO L93 Difference]: Finished difference Result 214 states and 614 transitions. [2021-06-05 21:43:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:06,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:06,578 INFO L225 Difference]: With dead ends: 214 [2021-06-05 21:43:06,578 INFO L226 Difference]: Without dead ends: 214 [2021-06-05 21:43:06,578 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-06-05 21:43:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 151. [2021-06-05 21:43:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 3.0) internal successors, (450), 150 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 450 transitions. [2021-06-05 21:43:06,580 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 450 transitions. Word has length 16 [2021-06-05 21:43:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:06,580 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 450 transitions. [2021-06-05 21:43:06,580 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 450 transitions. [2021-06-05 21:43:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:06,581 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:06,581 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:06,781 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable243 [2021-06-05 21:43:06,781 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1610047614, now seen corresponding path program 18 times [2021-06-05 21:43:06,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:06,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775470982] [2021-06-05 21:43:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:06,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:06,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775470982] [2021-06-05 21:43:06,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775470982] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:06,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:06,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:06,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107643546] [2021-06-05 21:43:06,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:06,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:06,814 INFO L87 Difference]: Start difference. First operand 151 states and 450 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:06,917 INFO L93 Difference]: Finished difference Result 191 states and 561 transitions. [2021-06-05 21:43:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:06,918 INFO L225 Difference]: With dead ends: 191 [2021-06-05 21:43:06,918 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 21:43:06,918 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 21:43:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2021-06-05 21:43:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0277777777777777) internal successors, (436), 144 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 436 transitions. [2021-06-05 21:43:06,920 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 436 transitions. Word has length 16 [2021-06-05 21:43:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:06,920 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 436 transitions. [2021-06-05 21:43:06,920 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 436 transitions. [2021-06-05 21:43:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:06,920 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:06,920 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:06,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2021-06-05 21:43:06,921 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:06,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1975020344, now seen corresponding path program 17 times [2021-06-05 21:43:06,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:06,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129671069] [2021-06-05 21:43:06,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:06,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:06,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129671069] [2021-06-05 21:43:06,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129671069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:06,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146109868] [2021-06-05 21:43:06,964 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:06,989 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:06,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:06,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:06,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:07,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146109868] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:07,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:07,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:07,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628587394] [2021-06-05 21:43:07,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:07,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:07,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:07,049 INFO L87 Difference]: Start difference. First operand 145 states and 436 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:07,141 INFO L93 Difference]: Finished difference Result 260 states and 749 transitions. [2021-06-05 21:43:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:07,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:07,142 INFO L225 Difference]: With dead ends: 260 [2021-06-05 21:43:07,142 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 21:43:07,142 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 85.4ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 21:43:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 152. [2021-06-05 21:43:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0927152317880795) internal successors, (467), 151 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 467 transitions. [2021-06-05 21:43:07,148 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 467 transitions. Word has length 16 [2021-06-05 21:43:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:07,148 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 467 transitions. [2021-06-05 21:43:07,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 467 transitions. [2021-06-05 21:43:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:07,149 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:07,149 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:07,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable245 [2021-06-05 21:43:07,364 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:07,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:07,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1124910778, now seen corresponding path program 19 times [2021-06-05 21:43:07,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:07,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452073908] [2021-06-05 21:43:07,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:07,396 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:07,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452073908] [2021-06-05 21:43:07,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452073908] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:07,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105877951] [2021-06-05 21:43:07,396 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:07,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:07,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:07,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105877951] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:07,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:07,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:07,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139897720] [2021-06-05 21:43:07,465 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:07,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:07,465 INFO L87 Difference]: Start difference. First operand 152 states and 467 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:07,555 INFO L93 Difference]: Finished difference Result 273 states and 794 transitions. [2021-06-05 21:43:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:07,556 INFO L225 Difference]: With dead ends: 273 [2021-06-05 21:43:07,556 INFO L226 Difference]: Without dead ends: 269 [2021-06-05 21:43:07,556 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-06-05 21:43:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 163. [2021-06-05 21:43:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.1049382716049383) internal successors, (503), 162 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 503 transitions. [2021-06-05 21:43:07,560 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 503 transitions. Word has length 16 [2021-06-05 21:43:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:07,560 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 503 transitions. [2021-06-05 21:43:07,560 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 503 transitions. [2021-06-05 21:43:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:07,561 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:07,561 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:07,772 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable246 [2021-06-05 21:43:07,773 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash 304044328, now seen corresponding path program 18 times [2021-06-05 21:43:07,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:07,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084858979] [2021-06-05 21:43:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:07,804 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:07,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084858979] [2021-06-05 21:43:07,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084858979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:07,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724429962] [2021-06-05 21:43:07,804 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:07,831 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:07,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:07,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:07,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:07,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724429962] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:07,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:07,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:07,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831496372] [2021-06-05 21:43:07,918 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:07,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:07,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:07,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:07,918 INFO L87 Difference]: Start difference. First operand 163 states and 503 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:08,008 INFO L93 Difference]: Finished difference Result 263 states and 760 transitions. [2021-06-05 21:43:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:08,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:08,009 INFO L225 Difference]: With dead ends: 263 [2021-06-05 21:43:08,009 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 21:43:08,009 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 81.4ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 21:43:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 163. [2021-06-05 21:43:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0864197530864197) internal successors, (500), 162 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 500 transitions. [2021-06-05 21:43:08,012 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 500 transitions. Word has length 16 [2021-06-05 21:43:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:08,012 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 500 transitions. [2021-06-05 21:43:08,012 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 500 transitions. [2021-06-05 21:43:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:08,012 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:08,012 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:08,224 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:08,225 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1230067772, now seen corresponding path program 20 times [2021-06-05 21:43:08,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:08,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896665716] [2021-06-05 21:43:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:08,273 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:08,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896665716] [2021-06-05 21:43:08,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896665716] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:08,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000527763] [2021-06-05 21:43:08,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:08,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:08,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:08,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:08,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:08,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000527763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:08,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:08,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:08,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937229944] [2021-06-05 21:43:08,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:08,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:08,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:08,357 INFO L87 Difference]: Start difference. First operand 163 states and 500 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:08,440 INFO L93 Difference]: Finished difference Result 281 states and 820 transitions. [2021-06-05 21:43:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:08,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:08,441 INFO L225 Difference]: With dead ends: 281 [2021-06-05 21:43:08,441 INFO L226 Difference]: Without dead ends: 281 [2021-06-05 21:43:08,441 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 76.0ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-06-05 21:43:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 160. [2021-06-05 21:43:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.088050314465409) internal successors, (491), 159 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 491 transitions. [2021-06-05 21:43:08,444 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 491 transitions. Word has length 16 [2021-06-05 21:43:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:08,444 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 491 transitions. [2021-06-05 21:43:08,444 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 491 transitions. [2021-06-05 21:43:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:08,445 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:08,445 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:08,652 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252,75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:08,653 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash -569696352, now seen corresponding path program 19 times [2021-06-05 21:43:08,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:08,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685203711] [2021-06-05 21:43:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:08,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:08,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685203711] [2021-06-05 21:43:08,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685203711] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:08,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830605822] [2021-06-05 21:43:08,684 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:08,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:08,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:08,791 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830605822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:08,791 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:08,791 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:08,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856130736] [2021-06-05 21:43:08,791 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:08,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:08,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:08,792 INFO L87 Difference]: Start difference. First operand 160 states and 491 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:08,876 INFO L93 Difference]: Finished difference Result 253 states and 725 transitions. [2021-06-05 21:43:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:08,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:08,877 INFO L225 Difference]: With dead ends: 253 [2021-06-05 21:43:08,877 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 21:43:08,877 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 75.3ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 21:43:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2021-06-05 21:43:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 21:43:08,881 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 21:43:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:08,881 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 21:43:08,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 21:43:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:08,882 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:08,882 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:09,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:09,097 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1211633746, now seen corresponding path program 21 times [2021-06-05 21:43:09,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:09,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420834910] [2021-06-05 21:43:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:09,126 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:09,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420834910] [2021-06-05 21:43:09,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420834910] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:09,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609126390] [2021-06-05 21:43:09,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:09,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:43:09,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:09,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:09,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:09,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609126390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:09,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:09,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:43:09,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727454402] [2021-06-05 21:43:09,198 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:43:09,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:09,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:43:09,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:43:09,198 INFO L87 Difference]: Start difference. First operand 160 states and 488 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:09,287 INFO L93 Difference]: Finished difference Result 294 states and 862 transitions. [2021-06-05 21:43:09,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:09,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:09,288 INFO L225 Difference]: With dead ends: 294 [2021-06-05 21:43:09,288 INFO L226 Difference]: Without dead ends: 294 [2021-06-05 21:43:09,288 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-06-05 21:43:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 157. [2021-06-05 21:43:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 3.0705128205128207) internal successors, (479), 156 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 479 transitions. [2021-06-05 21:43:09,290 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 479 transitions. Word has length 16 [2021-06-05 21:43:09,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:09,290 INFO L482 AbstractCegarLoop]: Abstraction has 157 states and 479 transitions. [2021-06-05 21:43:09,291 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 479 transitions. [2021-06-05 21:43:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:09,291 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:09,291 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:09,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable256 [2021-06-05 21:43:09,492 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:09,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:09,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1044998274, now seen corresponding path program 20 times [2021-06-05 21:43:09,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:09,492 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057180610] [2021-06-05 21:43:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:09,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:09,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057180610] [2021-06-05 21:43:09,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057180610] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:09,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639362393] [2021-06-05 21:43:09,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:09,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:09,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:09,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:09,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:09,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639362393] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:09,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:09,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 21:43:09,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462399925] [2021-06-05 21:43:09,659 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 21:43:09,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 21:43:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:09,659 INFO L87 Difference]: Start difference. First operand 157 states and 479 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:09,894 INFO L93 Difference]: Finished difference Result 282 states and 801 transitions. [2021-06-05 21:43:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:09,895 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:09,895 INFO L225 Difference]: With dead ends: 282 [2021-06-05 21:43:09,895 INFO L226 Difference]: Without dead ends: 282 [2021-06-05 21:43:09,895 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 199.3ms TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:43:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-06-05 21:43:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 165. [2021-06-05 21:43:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.1646341463414633) internal successors, (519), 164 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 519 transitions. [2021-06-05 21:43:09,898 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 519 transitions. Word has length 16 [2021-06-05 21:43:09,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:09,898 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 519 transitions. [2021-06-05 21:43:09,898 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 519 transitions. [2021-06-05 21:43:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:09,899 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:09,899 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:10,099 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable257 [2021-06-05 21:43:10,099 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash 150037900, now seen corresponding path program 22 times [2021-06-05 21:43:10,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:10,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293115984] [2021-06-05 21:43:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:10,134 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:10,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293115984] [2021-06-05 21:43:10,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293115984] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:10,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292107727] [2021-06-05 21:43:10,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:10,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:43:10,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:10,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:10,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:10,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292107727] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:10,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:10,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:10,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152087738] [2021-06-05 21:43:10,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:10,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:10,227 INFO L87 Difference]: Start difference. First operand 165 states and 519 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:10,316 INFO L93 Difference]: Finished difference Result 288 states and 815 transitions. [2021-06-05 21:43:10,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:10,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:10,316 INFO L225 Difference]: With dead ends: 288 [2021-06-05 21:43:10,317 INFO L226 Difference]: Without dead ends: 284 [2021-06-05 21:43:10,317 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 73.6ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-06-05 21:43:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 169. [2021-06-05 21:43:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 3.1904761904761907) internal successors, (536), 168 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 536 transitions. [2021-06-05 21:43:10,319 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 536 transitions. Word has length 16 [2021-06-05 21:43:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:10,320 INFO L482 AbstractCegarLoop]: Abstraction has 169 states and 536 transitions. [2021-06-05 21:43:10,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 536 transitions. [2021-06-05 21:43:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:10,320 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:10,320 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:10,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258,79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:10,521 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1578993006, now seen corresponding path program 21 times [2021-06-05 21:43:10,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:10,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518173277] [2021-06-05 21:43:10,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:10,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:10,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518173277] [2021-06-05 21:43:10,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518173277] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:10,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599015794] [2021-06-05 21:43:10,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:10,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:43:10,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:10,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:10,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:10,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599015794] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:10,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:10,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 21:43:10,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944306154] [2021-06-05 21:43:10,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 21:43:10,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:10,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 21:43:10,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:10,683 INFO L87 Difference]: Start difference. First operand 169 states and 536 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:10,863 INFO L93 Difference]: Finished difference Result 275 states and 778 transitions. [2021-06-05 21:43:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:10,864 INFO L225 Difference]: With dead ends: 275 [2021-06-05 21:43:10,864 INFO L226 Difference]: Without dead ends: 272 [2021-06-05 21:43:10,864 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 180.3ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:43:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-06-05 21:43:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 172. [2021-06-05 21:43:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 3.152046783625731) internal successors, (539), 171 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 539 transitions. [2021-06-05 21:43:10,867 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 539 transitions. Word has length 16 [2021-06-05 21:43:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:10,867 INFO L482 AbstractCegarLoop]: Abstraction has 172 states and 539 transitions. [2021-06-05 21:43:10,867 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 539 transitions. [2021-06-05 21:43:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:10,867 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:10,867 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:11,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261,80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:11,072 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1789950846, now seen corresponding path program 23 times [2021-06-05 21:43:11,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:11,074 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924848236] [2021-06-05 21:43:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:11,106 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:11,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924848236] [2021-06-05 21:43:11,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924848236] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:11,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798982768] [2021-06-05 21:43:11,106 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:11,135 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:11,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:11,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:11,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:11,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798982768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:11,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:11,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:11,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557399642] [2021-06-05 21:43:11,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:11,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:11,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:11,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:11,187 INFO L87 Difference]: Start difference. First operand 172 states and 539 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:11,274 INFO L93 Difference]: Finished difference Result 295 states and 843 transitions. [2021-06-05 21:43:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:11,274 INFO L225 Difference]: With dead ends: 295 [2021-06-05 21:43:11,274 INFO L226 Difference]: Without dead ends: 295 [2021-06-05 21:43:11,275 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 67.0ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-06-05 21:43:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 166. [2021-06-05 21:43:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.121212121212121) internal successors, (515), 165 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 515 transitions. [2021-06-05 21:43:11,278 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 515 transitions. Word has length 16 [2021-06-05 21:43:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:11,278 INFO L482 AbstractCegarLoop]: Abstraction has 166 states and 515 transitions. [2021-06-05 21:43:11,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 515 transitions. [2021-06-05 21:43:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:11,279 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:11,279 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:11,492 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264,81 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:11,493 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash -702414762, now seen corresponding path program 22 times [2021-06-05 21:43:11,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:11,493 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245376343] [2021-06-05 21:43:11,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:11,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:11,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245376343] [2021-06-05 21:43:11,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245376343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:11,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295196723] [2021-06-05 21:43:11,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:11,552 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:43:11,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:11,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:11,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:11,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295196723] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:11,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:11,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:11,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129692818] [2021-06-05 21:43:11,613 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:11,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:11,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:11,614 INFO L87 Difference]: Start difference. First operand 166 states and 515 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:11,718 INFO L93 Difference]: Finished difference Result 254 states and 721 transitions. [2021-06-05 21:43:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:11,719 INFO L225 Difference]: With dead ends: 254 [2021-06-05 21:43:11,719 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 21:43:11,719 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 80.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 21:43:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 161. [2021-06-05 21:43:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.10625) internal successors, (497), 160 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 497 transitions. [2021-06-05 21:43:11,722 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 497 transitions. Word has length 16 [2021-06-05 21:43:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:11,722 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 497 transitions. [2021-06-05 21:43:11,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 497 transitions. [2021-06-05 21:43:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:11,722 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:11,722 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:11,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265,82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:11,923 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:11,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1269298592, now seen corresponding path program 23 times [2021-06-05 21:43:11,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:11,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207482774] [2021-06-05 21:43:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:11,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:11,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207482774] [2021-06-05 21:43:11,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207482774] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:11,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558231650] [2021-06-05 21:43:11,970 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:12,004 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:12,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:12,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:12,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:12,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558231650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:12,075 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:12,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:12,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784855568] [2021-06-05 21:43:12,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:12,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:12,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:12,076 INFO L87 Difference]: Start difference. First operand 161 states and 497 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:12,174 INFO L93 Difference]: Finished difference Result 232 states and 667 transitions. [2021-06-05 21:43:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:12,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:12,174 INFO L225 Difference]: With dead ends: 232 [2021-06-05 21:43:12,175 INFO L226 Difference]: Without dead ends: 230 [2021-06-05 21:43:12,175 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-06-05 21:43:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 159. [2021-06-05 21:43:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0949367088607596) internal successors, (489), 158 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 489 transitions. [2021-06-05 21:43:12,177 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 489 transitions. Word has length 16 [2021-06-05 21:43:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:12,177 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 489 transitions. [2021-06-05 21:43:12,177 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 489 transitions. [2021-06-05 21:43:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:12,178 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:12,178 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:12,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable266 [2021-06-05 21:43:12,381 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:12,381 INFO L82 PathProgramCache]: Analyzing trace with hash -591395774, now seen corresponding path program 24 times [2021-06-05 21:43:12,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:12,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664659663] [2021-06-05 21:43:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:12,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:12,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664659663] [2021-06-05 21:43:12,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664659663] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:12,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:12,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:12,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876002672] [2021-06-05 21:43:12,420 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:12,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:12,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:12,420 INFO L87 Difference]: Start difference. First operand 159 states and 489 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:12,497 INFO L93 Difference]: Finished difference Result 244 states and 679 transitions. [2021-06-05 21:43:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:12,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:12,498 INFO L225 Difference]: With dead ends: 244 [2021-06-05 21:43:12,498 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 21:43:12,498 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 21:43:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 161. [2021-06-05 21:43:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.08125) internal successors, (493), 160 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 493 transitions. [2021-06-05 21:43:12,501 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 493 transitions. Word has length 16 [2021-06-05 21:43:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:12,501 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 493 transitions. [2021-06-05 21:43:12,501 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 493 transitions. [2021-06-05 21:43:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:12,501 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:12,501 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:12,501 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2021-06-05 21:43:12,501 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:12,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash -664768254, now seen corresponding path program 25 times [2021-06-05 21:43:12,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:12,502 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245576672] [2021-06-05 21:43:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:12,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:12,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245576672] [2021-06-05 21:43:12,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245576672] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:12,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:12,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:12,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154401655] [2021-06-05 21:43:12,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:12,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:12,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:12,531 INFO L87 Difference]: Start difference. First operand 161 states and 493 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:12,609 INFO L93 Difference]: Finished difference Result 227 states and 653 transitions. [2021-06-05 21:43:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:12,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:12,610 INFO L225 Difference]: With dead ends: 227 [2021-06-05 21:43:12,610 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 21:43:12,610 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 21:43:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 160. [2021-06-05 21:43:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0817610062893084) internal successors, (490), 159 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 490 transitions. [2021-06-05 21:43:12,612 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 490 transitions. Word has length 16 [2021-06-05 21:43:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:12,612 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 490 transitions. [2021-06-05 21:43:12,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 490 transitions. [2021-06-05 21:43:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:12,613 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:12,613 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:12,613 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-06-05 21:43:12,613 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1330475040, now seen corresponding path program 24 times [2021-06-05 21:43:12,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:12,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930342963] [2021-06-05 21:43:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:12,657 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:12,657 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930342963] [2021-06-05 21:43:12,657 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930342963] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:12,657 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:12,657 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:12,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609990936] [2021-06-05 21:43:12,657 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:12,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:12,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:12,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:12,658 INFO L87 Difference]: Start difference. First operand 160 states and 490 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:12,770 INFO L93 Difference]: Finished difference Result 242 states and 676 transitions. [2021-06-05 21:43:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:12,771 INFO L225 Difference]: With dead ends: 242 [2021-06-05 21:43:12,771 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 21:43:12,771 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:12,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 21:43:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 165. [2021-06-05 21:43:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.048780487804878) internal successors, (500), 164 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 500 transitions. [2021-06-05 21:43:12,774 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 500 transitions. Word has length 16 [2021-06-05 21:43:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:12,774 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 500 transitions. [2021-06-05 21:43:12,774 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 500 transitions. [2021-06-05 21:43:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:12,775 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:12,775 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:12,775 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-06-05 21:43:12,775 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:12,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:12,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1867164680, now seen corresponding path program 25 times [2021-06-05 21:43:12,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:12,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694855834] [2021-06-05 21:43:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:12,809 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:12,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694855834] [2021-06-05 21:43:12,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694855834] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:12,809 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:12,809 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:12,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088456702] [2021-06-05 21:43:12,809 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:12,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:12,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:12,810 INFO L87 Difference]: Start difference. First operand 165 states and 500 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:12,917 INFO L93 Difference]: Finished difference Result 229 states and 657 transitions. [2021-06-05 21:43:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:12,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:12,918 INFO L225 Difference]: With dead ends: 229 [2021-06-05 21:43:12,918 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 21:43:12,918 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 21:43:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 160. [2021-06-05 21:43:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0754716981132075) internal successors, (489), 159 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 489 transitions. [2021-06-05 21:43:12,921 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 489 transitions. Word has length 16 [2021-06-05 21:43:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:12,921 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 489 transitions. [2021-06-05 21:43:12,921 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 489 transitions. [2021-06-05 21:43:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:12,922 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:12,922 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:12,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2021-06-05 21:43:12,922 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1488468782, now seen corresponding path program 26 times [2021-06-05 21:43:12,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:12,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640941364] [2021-06-05 21:43:12,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:12,958 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:12,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640941364] [2021-06-05 21:43:12,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640941364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:12,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966117311] [2021-06-05 21:43:12,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:12,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:12,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:12,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:12,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:13,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966117311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:13,055 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:13,055 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:13,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792576606] [2021-06-05 21:43:13,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:13,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:13,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:13,056 INFO L87 Difference]: Start difference. First operand 160 states and 489 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:13,180 INFO L93 Difference]: Finished difference Result 257 states and 727 transitions. [2021-06-05 21:43:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:13,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:13,181 INFO L225 Difference]: With dead ends: 257 [2021-06-05 21:43:13,181 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 21:43:13,181 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 21:43:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 162. [2021-06-05 21:43:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 3.0869565217391304) internal successors, (497), 161 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 497 transitions. [2021-06-05 21:43:13,187 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 497 transitions. Word has length 16 [2021-06-05 21:43:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:13,187 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 497 transitions. [2021-06-05 21:43:13,187 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 497 transitions. [2021-06-05 21:43:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:13,188 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:13,188 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:13,409 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273,84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:13,409 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash -126912676, now seen corresponding path program 27 times [2021-06-05 21:43:13,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:13,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10723038] [2021-06-05 21:43:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:13,442 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:13,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10723038] [2021-06-05 21:43:13,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10723038] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:13,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:13,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:13,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012188768] [2021-06-05 21:43:13,442 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:13,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:13,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:13,443 INFO L87 Difference]: Start difference. First operand 162 states and 497 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:13,539 INFO L93 Difference]: Finished difference Result 234 states and 674 transitions. [2021-06-05 21:43:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:13,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:13,540 INFO L225 Difference]: With dead ends: 234 [2021-06-05 21:43:13,540 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 21:43:13,540 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 21:43:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 159. [2021-06-05 21:43:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0759493670886076) internal successors, (486), 158 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 486 transitions. [2021-06-05 21:43:13,543 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 486 transitions. Word has length 16 [2021-06-05 21:43:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:13,543 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 486 transitions. [2021-06-05 21:43:13,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 486 transitions. [2021-06-05 21:43:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:13,544 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:13,544 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:13,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2021-06-05 21:43:13,544 INFO L430 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:13,544 INFO L82 PathProgramCache]: Analyzing trace with hash -568892562, now seen corresponding path program 26 times [2021-06-05 21:43:13,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:13,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547248258] [2021-06-05 21:43:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:13,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:13,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547248258] [2021-06-05 21:43:13,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547248258] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:13,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:13,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:13,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647954297] [2021-06-05 21:43:13,576 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:13,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:13,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:13,576 INFO L87 Difference]: Start difference. First operand 159 states and 486 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:13,688 INFO L93 Difference]: Finished difference Result 213 states and 612 transitions. [2021-06-05 21:43:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:13,689 INFO L225 Difference]: With dead ends: 213 [2021-06-05 21:43:13,689 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 21:43:13,689 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 80.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:13,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 21:43:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 160. [2021-06-05 21:43:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0628930817610063) internal successors, (487), 159 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 487 transitions. [2021-06-05 21:43:13,693 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 487 transitions. Word has length 16 [2021-06-05 21:43:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:13,693 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 487 transitions. [2021-06-05 21:43:13,693 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 487 transitions. [2021-06-05 21:43:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:13,694 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:13,694 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:13,694 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2021-06-05 21:43:13,694 INFO L430 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:13,694 INFO L82 PathProgramCache]: Analyzing trace with hash 857708136, now seen corresponding path program 27 times [2021-06-05 21:43:13,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:13,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248314534] [2021-06-05 21:43:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:13,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:13,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248314534] [2021-06-05 21:43:13,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248314534] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:13,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:13,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:13,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428430003] [2021-06-05 21:43:13,727 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:13,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:13,727 INFO L87 Difference]: Start difference. First operand 160 states and 487 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:13,832 INFO L93 Difference]: Finished difference Result 210 states and 602 transitions. [2021-06-05 21:43:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:13,833 INFO L225 Difference]: With dead ends: 210 [2021-06-05 21:43:13,833 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 21:43:13,833 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 84.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 21:43:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 165. [2021-06-05 21:43:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.0304878048780486) internal successors, (497), 164 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 497 transitions. [2021-06-05 21:43:13,835 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 497 transitions. Word has length 16 [2021-06-05 21:43:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:13,836 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 497 transitions. [2021-06-05 21:43:13,836 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 497 transitions. [2021-06-05 21:43:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:13,836 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:13,836 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:13,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-06-05 21:43:13,836 INFO L430 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash -239619440, now seen corresponding path program 28 times [2021-06-05 21:43:13,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:13,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861293389] [2021-06-05 21:43:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:13,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:13,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861293389] [2021-06-05 21:43:13,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861293389] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:13,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:13,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:13,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828746903] [2021-06-05 21:43:13,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:13,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:13,871 INFO L87 Difference]: Start difference. First operand 165 states and 497 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:13,976 INFO L93 Difference]: Finished difference Result 197 states and 583 transitions. [2021-06-05 21:43:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:13,977 INFO L225 Difference]: With dead ends: 197 [2021-06-05 21:43:13,977 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 21:43:13,978 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 21:43:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 159. [2021-06-05 21:43:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.069620253164557) internal successors, (485), 158 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 485 transitions. [2021-06-05 21:43:13,981 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 485 transitions. Word has length 16 [2021-06-05 21:43:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:13,981 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 485 transitions. [2021-06-05 21:43:13,981 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 485 transitions. [2021-06-05 21:43:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:13,981 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:13,981 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:13,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2021-06-05 21:43:13,982 INFO L430 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:13,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1967643138, now seen corresponding path program 28 times [2021-06-05 21:43:13,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:13,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501920767] [2021-06-05 21:43:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:43:14,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:14,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501920767] [2021-06-05 21:43:14,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501920767] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:14,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036099113] [2021-06-05 21:43:14,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:14,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:43:14,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:14,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:14,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:14,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036099113] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:14,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:14,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 21:43:14,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993806752] [2021-06-05 21:43:14,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:14,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:14,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:14,143 INFO L87 Difference]: Start difference. First operand 159 states and 485 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:14,472 INFO L93 Difference]: Finished difference Result 288 states and 829 transitions. [2021-06-05 21:43:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:43:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:14,473 INFO L225 Difference]: With dead ends: 288 [2021-06-05 21:43:14,473 INFO L226 Difference]: Without dead ends: 277 [2021-06-05 21:43:14,473 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 299.0ms TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:43:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-06-05 21:43:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 147. [2021-06-05 21:43:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0342465753424657) internal successors, (443), 146 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 443 transitions. [2021-06-05 21:43:14,476 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 443 transitions. Word has length 16 [2021-06-05 21:43:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:14,476 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 443 transitions. [2021-06-05 21:43:14,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 443 transitions. [2021-06-05 21:43:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:14,477 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:14,477 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:14,680 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable278 [2021-06-05 21:43:14,681 INFO L430 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:14,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1038652820, now seen corresponding path program 29 times [2021-06-05 21:43:14,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:14,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341001315] [2021-06-05 21:43:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:14,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:14,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341001315] [2021-06-05 21:43:14,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341001315] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:14,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185540029] [2021-06-05 21:43:14,718 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:14,763 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:14,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:14,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:14,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:14,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185540029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:14,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:14,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:43:14,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159451500] [2021-06-05 21:43:14,807 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:43:14,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:43:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:43:14,808 INFO L87 Difference]: Start difference. First operand 147 states and 443 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:14,904 INFO L93 Difference]: Finished difference Result 224 states and 647 transitions. [2021-06-05 21:43:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:14,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:14,905 INFO L225 Difference]: With dead ends: 224 [2021-06-05 21:43:14,905 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 21:43:14,905 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 68.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 21:43:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 147. [2021-06-05 21:43:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0342465753424657) internal successors, (443), 146 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 443 transitions. [2021-06-05 21:43:14,910 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 443 transitions. Word has length 16 [2021-06-05 21:43:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:14,910 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 443 transitions. [2021-06-05 21:43:14,910 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 443 transitions. [2021-06-05 21:43:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:14,910 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:14,910 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:15,120 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable279 [2021-06-05 21:43:15,120 INFO L430 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:15,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:15,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1592318946, now seen corresponding path program 29 times [2021-06-05 21:43:15,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:15,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996006625] [2021-06-05 21:43:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:15,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:15,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996006625] [2021-06-05 21:43:15,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996006625] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:15,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227717525] [2021-06-05 21:43:15,151 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:15,186 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:15,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:15,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:15,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:15,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227717525] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:15,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:15,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:15,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194936600] [2021-06-05 21:43:15,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:15,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:15,243 INFO L87 Difference]: Start difference. First operand 147 states and 443 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:15,322 INFO L93 Difference]: Finished difference Result 244 states and 672 transitions. [2021-06-05 21:43:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:15,323 INFO L225 Difference]: With dead ends: 244 [2021-06-05 21:43:15,323 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 21:43:15,323 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 75.3ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 21:43:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 147. [2021-06-05 21:43:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0) internal successors, (438), 146 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 438 transitions. [2021-06-05 21:43:15,326 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 438 transitions. Word has length 16 [2021-06-05 21:43:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:15,326 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 438 transitions. [2021-06-05 21:43:15,326 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 438 transitions. [2021-06-05 21:43:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:15,327 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:15,327 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:15,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable280 [2021-06-05 21:43:15,545 INFO L430 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:15,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1253778718, now seen corresponding path program 30 times [2021-06-05 21:43:15,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:15,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377851110] [2021-06-05 21:43:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:15,581 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:15,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377851110] [2021-06-05 21:43:15,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377851110] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:15,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240972040] [2021-06-05 21:43:15,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:15,619 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:15,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:15,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:15,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:15,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240972040] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:15,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:15,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:15,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124157660] [2021-06-05 21:43:15,663 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:15,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:15,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:15,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:15,664 INFO L87 Difference]: Start difference. First operand 147 states and 438 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:15,745 INFO L93 Difference]: Finished difference Result 248 states and 707 transitions. [2021-06-05 21:43:15,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:15,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:15,746 INFO L225 Difference]: With dead ends: 248 [2021-06-05 21:43:15,746 INFO L226 Difference]: Without dead ends: 248 [2021-06-05 21:43:15,746 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 69.1ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-06-05 21:43:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 153. [2021-06-05 21:43:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0789473684210527) internal successors, (468), 152 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 468 transitions. [2021-06-05 21:43:15,748 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 468 transitions. Word has length 16 [2021-06-05 21:43:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:15,749 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 468 transitions. [2021-06-05 21:43:15,749 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 468 transitions. [2021-06-05 21:43:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:15,749 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:15,749 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:15,957 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283,88 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:15,957 INFO L430 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1846152404, now seen corresponding path program 30 times [2021-06-05 21:43:15,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:15,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675057486] [2021-06-05 21:43:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:16,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:16,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675057486] [2021-06-05 21:43:16,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675057486] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:16,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397964442] [2021-06-05 21:43:16,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:16,054 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:16,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:16,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:16,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:16,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397964442] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:16,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:16,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:16,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112627010] [2021-06-05 21:43:16,120 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:16,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:16,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:16,121 INFO L87 Difference]: Start difference. First operand 153 states and 468 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:16,208 INFO L93 Difference]: Finished difference Result 264 states and 730 transitions. [2021-06-05 21:43:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:16,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:16,209 INFO L225 Difference]: With dead ends: 264 [2021-06-05 21:43:16,209 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 21:43:16,209 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 95.5ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 21:43:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 160. [2021-06-05 21:43:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 21:43:16,213 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 21:43:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:16,213 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 21:43:16,213 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 21:43:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:16,213 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:16,213 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:16,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284,89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:16,435 INFO L430 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:16,436 INFO L82 PathProgramCache]: Analyzing trace with hash -417197298, now seen corresponding path program 31 times [2021-06-05 21:43:16,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:16,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050164536] [2021-06-05 21:43:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:16,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:16,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050164536] [2021-06-05 21:43:16,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050164536] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:16,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727954987] [2021-06-05 21:43:16,471 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:16,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:16,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:16,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727954987] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:16,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:16,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:16,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53358962] [2021-06-05 21:43:16,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:16,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:16,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:16,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:16,546 INFO L87 Difference]: Start difference. First operand 160 states and 488 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:16,621 INFO L93 Difference]: Finished difference Result 231 states and 665 transitions. [2021-06-05 21:43:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:16,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:16,622 INFO L225 Difference]: With dead ends: 231 [2021-06-05 21:43:16,622 INFO L226 Difference]: Without dead ends: 228 [2021-06-05 21:43:16,622 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-06-05 21:43:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 163. [2021-06-05 21:43:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0308641975308643) internal successors, (491), 162 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 491 transitions. [2021-06-05 21:43:16,624 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 491 transitions. Word has length 16 [2021-06-05 21:43:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:16,624 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 491 transitions. [2021-06-05 21:43:16,624 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 491 transitions. [2021-06-05 21:43:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:16,625 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:16,625 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:16,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287,90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:16,825 INFO L430 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash 508826146, now seen corresponding path program 31 times [2021-06-05 21:43:16,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:16,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978051173] [2021-06-05 21:43:16,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:16,863 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:16,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978051173] [2021-06-05 21:43:16,863 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978051173] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:16,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089367795] [2021-06-05 21:43:16,863 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:16,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:16,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:16,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089367795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:16,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:16,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:16,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775176772] [2021-06-05 21:43:16,946 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:16,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:16,946 INFO L87 Difference]: Start difference. First operand 163 states and 491 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:17,026 INFO L93 Difference]: Finished difference Result 249 states and 699 transitions. [2021-06-05 21:43:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:17,027 INFO L225 Difference]: With dead ends: 249 [2021-06-05 21:43:17,027 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 21:43:17,027 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 86.8ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 21:43:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2021-06-05 21:43:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.020408163265306) internal successors, (444), 147 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 444 transitions. [2021-06-05 21:43:17,030 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 444 transitions. Word has length 16 [2021-06-05 21:43:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:17,030 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 444 transitions. [2021-06-05 21:43:17,030 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 444 transitions. [2021-06-05 21:43:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:17,030 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:17,030 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:17,230 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290,91 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:17,231 INFO L430 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:17,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash 991501460, now seen corresponding path program 32 times [2021-06-05 21:43:17,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:17,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398345389] [2021-06-05 21:43:17,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:17,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:17,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398345389] [2021-06-05 21:43:17,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398345389] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:17,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526658643] [2021-06-05 21:43:17,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:17,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:17,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:17,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:17,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:17,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526658643] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:17,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:17,343 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:43:17,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999573480] [2021-06-05 21:43:17,343 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:43:17,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:17,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:43:17,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:43:17,343 INFO L87 Difference]: Start difference. First operand 148 states and 444 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:17,437 INFO L93 Difference]: Finished difference Result 304 states and 875 transitions. [2021-06-05 21:43:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:17,438 INFO L225 Difference]: With dead ends: 304 [2021-06-05 21:43:17,438 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 21:43:17,438 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 57.0ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 21:43:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 152. [2021-06-05 21:43:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.019867549668874) internal successors, (456), 151 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 456 transitions. [2021-06-05 21:43:17,441 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 456 transitions. Word has length 16 [2021-06-05 21:43:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:17,441 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 456 transitions. [2021-06-05 21:43:17,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 456 transitions. [2021-06-05 21:43:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:17,441 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:17,441 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:17,663 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable291 [2021-06-05 21:43:17,663 INFO L430 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash -501516022, now seen corresponding path program 33 times [2021-06-05 21:43:17,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:17,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198448786] [2021-06-05 21:43:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:17,703 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:17,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198448786] [2021-06-05 21:43:17,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198448786] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:17,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533811629] [2021-06-05 21:43:17,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:17,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:43:17,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:17,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:17,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:17,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533811629] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:17,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:17,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:17,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029029319] [2021-06-05 21:43:17,788 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:17,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:17,788 INFO L87 Difference]: Start difference. First operand 152 states and 456 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:17,898 INFO L93 Difference]: Finished difference Result 279 states and 796 transitions. [2021-06-05 21:43:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:17,898 INFO L225 Difference]: With dead ends: 279 [2021-06-05 21:43:17,899 INFO L226 Difference]: Without dead ends: 279 [2021-06-05 21:43:17,899 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-06-05 21:43:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 154. [2021-06-05 21:43:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.0326797385620914) internal successors, (464), 153 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 464 transitions. [2021-06-05 21:43:17,901 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 464 transitions. Word has length 16 [2021-06-05 21:43:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:17,901 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 464 transitions. [2021-06-05 21:43:17,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 464 transitions. [2021-06-05 21:43:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:17,901 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:17,901 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:18,102 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292,93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:18,102 INFO L430 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:18,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:18,102 INFO L82 PathProgramCache]: Analyzing trace with hash 108641226, now seen corresponding path program 34 times [2021-06-05 21:43:18,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:18,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874410772] [2021-06-05 21:43:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:18,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:18,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874410772] [2021-06-05 21:43:18,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874410772] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:18,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020059182] [2021-06-05 21:43:18,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:18,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:43:18,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:18,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:18,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:18,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020059182] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:18,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:18,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:18,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913311263] [2021-06-05 21:43:18,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:18,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:18,227 INFO L87 Difference]: Start difference. First operand 154 states and 464 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:18,330 INFO L93 Difference]: Finished difference Result 255 states and 738 transitions. [2021-06-05 21:43:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:18,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:18,331 INFO L225 Difference]: With dead ends: 255 [2021-06-05 21:43:18,331 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 21:43:18,331 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 66.7ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 21:43:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 148. [2021-06-05 21:43:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.020408163265306) internal successors, (444), 147 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 444 transitions. [2021-06-05 21:43:18,333 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 444 transitions. Word has length 16 [2021-06-05 21:43:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:18,333 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 444 transitions. [2021-06-05 21:43:18,333 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 444 transitions. [2021-06-05 21:43:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:18,334 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:18,334 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:18,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable293 [2021-06-05 21:43:18,534 INFO L430 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash 82711532, now seen corresponding path program 32 times [2021-06-05 21:43:18,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:18,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399959542] [2021-06-05 21:43:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:18,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:18,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399959542] [2021-06-05 21:43:18,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399959542] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:18,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:18,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:18,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626740940] [2021-06-05 21:43:18,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:18,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:18,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:18,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:18,570 INFO L87 Difference]: Start difference. First operand 148 states and 444 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:18,665 INFO L93 Difference]: Finished difference Result 276 states and 746 transitions. [2021-06-05 21:43:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:18,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:18,666 INFO L225 Difference]: With dead ends: 276 [2021-06-05 21:43:18,666 INFO L226 Difference]: Without dead ends: 266 [2021-06-05 21:43:18,666 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-06-05 21:43:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 150. [2021-06-05 21:43:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.9932885906040267) internal successors, (446), 149 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 446 transitions. [2021-06-05 21:43:18,669 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 446 transitions. Word has length 16 [2021-06-05 21:43:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:18,669 INFO L482 AbstractCegarLoop]: Abstraction has 150 states and 446 transitions. [2021-06-05 21:43:18,669 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 446 transitions. [2021-06-05 21:43:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:18,670 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:18,670 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:18,670 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2021-06-05 21:43:18,670 INFO L430 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:18,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1741550036, now seen corresponding path program 33 times [2021-06-05 21:43:18,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:18,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365426682] [2021-06-05 21:43:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:18,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:18,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365426682] [2021-06-05 21:43:18,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365426682] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:18,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:18,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:18,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272932311] [2021-06-05 21:43:18,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:18,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:18,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:18,708 INFO L87 Difference]: Start difference. First operand 150 states and 446 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:18,803 INFO L93 Difference]: Finished difference Result 269 states and 726 transitions. [2021-06-05 21:43:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:18,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:18,804 INFO L225 Difference]: With dead ends: 269 [2021-06-05 21:43:18,804 INFO L226 Difference]: Without dead ends: 265 [2021-06-05 21:43:18,804 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 60.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-05 21:43:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 156. [2021-06-05 21:43:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.9548387096774196) internal successors, (458), 155 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 458 transitions. [2021-06-05 21:43:18,806 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 458 transitions. Word has length 16 [2021-06-05 21:43:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:18,807 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 458 transitions. [2021-06-05 21:43:18,807 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 458 transitions. [2021-06-05 21:43:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:18,807 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:18,807 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:18,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2021-06-05 21:43:18,807 INFO L430 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1814922516, now seen corresponding path program 34 times [2021-06-05 21:43:18,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:18,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412868953] [2021-06-05 21:43:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:18,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:18,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412868953] [2021-06-05 21:43:18,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412868953] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:18,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:18,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:18,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78911423] [2021-06-05 21:43:18,842 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:18,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:18,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:18,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:18,842 INFO L87 Difference]: Start difference. First operand 156 states and 458 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:18,919 INFO L93 Difference]: Finished difference Result 254 states and 704 transitions. [2021-06-05 21:43:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:18,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:18,921 INFO L225 Difference]: With dead ends: 254 [2021-06-05 21:43:18,921 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 21:43:18,921 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.3ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 21:43:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2021-06-05 21:43:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.006802721088435) internal successors, (442), 147 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 442 transitions. [2021-06-05 21:43:18,923 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 442 transitions. Word has length 16 [2021-06-05 21:43:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:18,924 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 442 transitions. [2021-06-05 21:43:18,924 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 442 transitions. [2021-06-05 21:43:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:18,924 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:18,924 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:18,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2021-06-05 21:43:18,924 INFO L430 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash 499376906, now seen corresponding path program 35 times [2021-06-05 21:43:18,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:18,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430201105] [2021-06-05 21:43:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:18,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:18,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430201105] [2021-06-05 21:43:18,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430201105] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:18,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112969836] [2021-06-05 21:43:18,978 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:19,015 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:19,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:19,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:19,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:19,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112969836] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:19,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:19,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:19,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911785505] [2021-06-05 21:43:19,091 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:19,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:19,091 INFO L87 Difference]: Start difference. First operand 148 states and 442 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:19,325 INFO L93 Difference]: Finished difference Result 297 states and 849 transitions. [2021-06-05 21:43:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:19,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:19,326 INFO L225 Difference]: With dead ends: 297 [2021-06-05 21:43:19,326 INFO L226 Difference]: Without dead ends: 297 [2021-06-05 21:43:19,326 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 197.2ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:43:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-06-05 21:43:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 156. [2021-06-05 21:43:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 3.109677419354839) internal successors, (482), 155 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 482 transitions. [2021-06-05 21:43:19,329 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 482 transitions. Word has length 16 [2021-06-05 21:43:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:19,330 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 482 transitions. [2021-06-05 21:43:19,330 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 482 transitions. [2021-06-05 21:43:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:19,330 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:19,330 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:19,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable299 [2021-06-05 21:43:19,552 INFO L430 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:19,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1694413080, now seen corresponding path program 35 times [2021-06-05 21:43:19,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:19,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576881567] [2021-06-05 21:43:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:19,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:19,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576881567] [2021-06-05 21:43:19,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576881567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:19,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800766610] [2021-06-05 21:43:19,590 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:19,635 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:19,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:19,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:19,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:19,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800766610] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:19,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:19,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:19,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232816554] [2021-06-05 21:43:19,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:19,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:19,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:19,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:19,707 INFO L87 Difference]: Start difference. First operand 156 states and 482 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:19,807 INFO L93 Difference]: Finished difference Result 308 states and 850 transitions. [2021-06-05 21:43:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:19,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:19,807 INFO L225 Difference]: With dead ends: 308 [2021-06-05 21:43:19,808 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 21:43:19,808 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 87.1ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 21:43:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 164. [2021-06-05 21:43:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 3.1104294478527605) internal successors, (507), 163 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 507 transitions. [2021-06-05 21:43:19,810 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 507 transitions. Word has length 16 [2021-06-05 21:43:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:19,810 INFO L482 AbstractCegarLoop]: Abstraction has 164 states and 507 transitions. [2021-06-05 21:43:19,810 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 507 transitions. [2021-06-05 21:43:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:19,811 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:19,811 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:20,011 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable300 [2021-06-05 21:43:20,011 INFO L430 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1171599110, now seen corresponding path program 36 times [2021-06-05 21:43:20,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:20,012 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354638038] [2021-06-05 21:43:20,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:20,062 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:20,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354638038] [2021-06-05 21:43:20,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354638038] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:20,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770628028] [2021-06-05 21:43:20,062 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:20,095 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:20,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:20,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:20,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:20,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770628028] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:20,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:20,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:20,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961253361] [2021-06-05 21:43:20,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:20,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:20,159 INFO L87 Difference]: Start difference. First operand 164 states and 507 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:20,312 INFO L93 Difference]: Finished difference Result 297 states and 840 transitions. [2021-06-05 21:43:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:20,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:20,313 INFO L225 Difference]: With dead ends: 297 [2021-06-05 21:43:20,313 INFO L226 Difference]: Without dead ends: 294 [2021-06-05 21:43:20,313 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 154.8ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:43:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-06-05 21:43:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 161. [2021-06-05 21:43:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.05625) internal successors, (489), 160 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 489 transitions. [2021-06-05 21:43:20,315 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 489 transitions. Word has length 16 [2021-06-05 21:43:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:20,316 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 489 transitions. [2021-06-05 21:43:20,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 489 transitions. [2021-06-05 21:43:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:20,316 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:20,316 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:20,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable303 [2021-06-05 21:43:20,516 INFO L430 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -245575666, now seen corresponding path program 36 times [2021-06-05 21:43:20,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:20,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259800946] [2021-06-05 21:43:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:20,554 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:20,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259800946] [2021-06-05 21:43:20,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259800946] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:20,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892812963] [2021-06-05 21:43:20,554 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:20,580 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:20,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:20,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:20,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:20,639 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892812963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:20,639 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:20,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:20,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581100994] [2021-06-05 21:43:20,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:20,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:20,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:20,640 INFO L87 Difference]: Start difference. First operand 161 states and 489 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:20,727 INFO L93 Difference]: Finished difference Result 317 states and 873 transitions. [2021-06-05 21:43:20,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:20,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:20,728 INFO L225 Difference]: With dead ends: 317 [2021-06-05 21:43:20,728 INFO L226 Difference]: Without dead ends: 317 [2021-06-05 21:43:20,728 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 81.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-06-05 21:43:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 158. [2021-06-05 21:43:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0573248407643314) internal successors, (480), 157 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 480 transitions. [2021-06-05 21:43:20,730 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 480 transitions. Word has length 16 [2021-06-05 21:43:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:20,730 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 480 transitions. [2021-06-05 21:43:20,730 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 480 transitions. [2021-06-05 21:43:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:20,731 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:20,731 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:20,931 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306,98 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:20,931 INFO L430 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 841960418, now seen corresponding path program 37 times [2021-06-05 21:43:20,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:20,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116607058] [2021-06-05 21:43:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:20,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:20,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116607058] [2021-06-05 21:43:20,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116607058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:20,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706155297] [2021-06-05 21:43:20,963 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:20,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:20,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:21,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706155297] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:21,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:21,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:21,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737959142] [2021-06-05 21:43:21,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:21,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:21,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:21,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:21,048 INFO L87 Difference]: Start difference. First operand 158 states and 480 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:21,137 INFO L93 Difference]: Finished difference Result 295 states and 832 transitions. [2021-06-05 21:43:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:21,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:21,137 INFO L225 Difference]: With dead ends: 295 [2021-06-05 21:43:21,137 INFO L226 Difference]: Without dead ends: 295 [2021-06-05 21:43:21,138 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 66.8ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-06-05 21:43:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2021-06-05 21:43:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 21:43:21,140 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 21:43:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:21,140 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 21:43:21,140 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 21:43:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:21,140 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:21,140 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:21,341 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307,99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:21,341 INFO L430 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1481293524, now seen corresponding path program 38 times [2021-06-05 21:43:21,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:21,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370227735] [2021-06-05 21:43:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:21,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:21,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370227735] [2021-06-05 21:43:21,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370227735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:21,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492421683] [2021-06-05 21:43:21,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:21,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:21,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:21,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:21,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:21,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492421683] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:21,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:21,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:21,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579984728] [2021-06-05 21:43:21,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:21,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:21,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:21,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:21,455 INFO L87 Difference]: Start difference. First operand 160 states and 488 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:21,555 INFO L93 Difference]: Finished difference Result 273 states and 778 transitions. [2021-06-05 21:43:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:21,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:21,556 INFO L225 Difference]: With dead ends: 273 [2021-06-05 21:43:21,556 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 21:43:21,556 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 75.1ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 21:43:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 158. [2021-06-05 21:43:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0573248407643314) internal successors, (480), 157 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 480 transitions. [2021-06-05 21:43:21,559 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 480 transitions. Word has length 16 [2021-06-05 21:43:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:21,559 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 480 transitions. [2021-06-05 21:43:21,559 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 480 transitions. [2021-06-05 21:43:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:21,560 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:21,560 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:21,781 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable308 [2021-06-05 21:43:21,782 INFO L430 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:21,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 952979406, now seen corresponding path program 37 times [2021-06-05 21:43:21,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:21,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861527397] [2021-06-05 21:43:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:21,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:21,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861527397] [2021-06-05 21:43:21,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861527397] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:21,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:21,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:21,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431272534] [2021-06-05 21:43:21,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:21,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:21,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:21,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:21,818 INFO L87 Difference]: Start difference. First operand 158 states and 480 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:21,912 INFO L93 Difference]: Finished difference Result 296 states and 795 transitions. [2021-06-05 21:43:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:21,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:21,913 INFO L225 Difference]: With dead ends: 296 [2021-06-05 21:43:21,914 INFO L226 Difference]: Without dead ends: 292 [2021-06-05 21:43:21,914 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-06-05 21:43:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 160. [2021-06-05 21:43:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0440251572327046) internal successors, (484), 159 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 484 transitions. [2021-06-05 21:43:21,917 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 484 transitions. Word has length 16 [2021-06-05 21:43:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:21,917 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 484 transitions. [2021-06-05 21:43:21,917 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 484 transitions. [2021-06-05 21:43:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:21,917 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:21,918 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:21,918 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-06-05 21:43:21,918 INFO L430 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:21,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:21,918 INFO L82 PathProgramCache]: Analyzing trace with hash 879606926, now seen corresponding path program 38 times [2021-06-05 21:43:21,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:21,918 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393079923] [2021-06-05 21:43:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:21,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:21,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393079923] [2021-06-05 21:43:21,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393079923] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:21,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:21,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:21,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272039521] [2021-06-05 21:43:21,953 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:21,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:21,954 INFO L87 Difference]: Start difference. First operand 160 states and 484 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:22,039 INFO L93 Difference]: Finished difference Result 279 states and 769 transitions. [2021-06-05 21:43:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:22,040 INFO L225 Difference]: With dead ends: 279 [2021-06-05 21:43:22,040 INFO L226 Difference]: Without dead ends: 276 [2021-06-05 21:43:22,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-06-05 21:43:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 159. [2021-06-05 21:43:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0443037974683542) internal successors, (481), 158 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 481 transitions. [2021-06-05 21:43:22,043 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 481 transitions. Word has length 16 [2021-06-05 21:43:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:22,043 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 481 transitions. [2021-06-05 21:43:22,043 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 481 transitions. [2021-06-05 21:43:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:22,044 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:22,044 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:22,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2021-06-05 21:43:22,044 INFO L430 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 213900140, now seen corresponding path program 39 times [2021-06-05 21:43:22,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:22,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680211264] [2021-06-05 21:43:22,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:22,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:22,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680211264] [2021-06-05 21:43:22,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680211264] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:22,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:22,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:22,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949696032] [2021-06-05 21:43:22,076 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:22,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:22,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:22,077 INFO L87 Difference]: Start difference. First operand 159 states and 481 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:22,163 INFO L93 Difference]: Finished difference Result 259 states and 730 transitions. [2021-06-05 21:43:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:22,164 INFO L225 Difference]: With dead ends: 259 [2021-06-05 21:43:22,165 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 21:43:22,165 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 21:43:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 161. [2021-06-05 21:43:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.03125) internal successors, (485), 160 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 485 transitions. [2021-06-05 21:43:22,168 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 485 transitions. Word has length 16 [2021-06-05 21:43:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:22,168 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 485 transitions. [2021-06-05 21:43:22,168 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 485 transitions. [2021-06-05 21:43:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:22,169 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:22,173 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:22,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2021-06-05 21:43:22,175 INFO L430 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash -883427436, now seen corresponding path program 40 times [2021-06-05 21:43:22,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:22,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220647287] [2021-06-05 21:43:22,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:22,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:22,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220647287] [2021-06-05 21:43:22,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220647287] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:22,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:22,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:22,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866320229] [2021-06-05 21:43:22,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:22,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:22,213 INFO L87 Difference]: Start difference. First operand 161 states and 485 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:22,285 INFO L93 Difference]: Finished difference Result 245 states and 709 transitions. [2021-06-05 21:43:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:22,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:22,286 INFO L225 Difference]: With dead ends: 245 [2021-06-05 21:43:22,286 INFO L226 Difference]: Without dead ends: 242 [2021-06-05 21:43:22,287 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-06-05 21:43:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 160. [2021-06-05 21:43:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0314465408805034) internal successors, (482), 159 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 482 transitions. [2021-06-05 21:43:22,289 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 482 transitions. Word has length 16 [2021-06-05 21:43:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:22,289 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 482 transitions. [2021-06-05 21:43:22,290 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 482 transitions. [2021-06-05 21:43:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:22,290 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:22,290 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:22,290 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2021-06-05 21:43:22,290 INFO L430 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash 55906398, now seen corresponding path program 39 times [2021-06-05 21:43:22,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:22,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707814677] [2021-06-05 21:43:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:22,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:22,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707814677] [2021-06-05 21:43:22,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707814677] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:22,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172281128] [2021-06-05 21:43:22,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:22,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:43:22,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:22,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:22,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:22,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172281128] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:22,433 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:22,433 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:22,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565592453] [2021-06-05 21:43:22,433 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:22,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:22,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:22,433 INFO L87 Difference]: Start difference. First operand 160 states and 482 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:22,539 INFO L93 Difference]: Finished difference Result 285 states and 786 transitions. [2021-06-05 21:43:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:22,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:22,540 INFO L225 Difference]: With dead ends: 285 [2021-06-05 21:43:22,540 INFO L226 Difference]: Without dead ends: 285 [2021-06-05 21:43:22,540 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 85.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-06-05 21:43:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 158. [2021-06-05 21:43:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9936305732484074) internal successors, (470), 157 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 470 transitions. [2021-06-05 21:43:22,543 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 470 transitions. Word has length 16 [2021-06-05 21:43:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:22,544 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 470 transitions. [2021-06-05 21:43:22,544 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 470 transitions. [2021-06-05 21:43:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:22,544 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:22,544 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:22,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315,101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:22,744 INFO L430 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1417462504, now seen corresponding path program 40 times [2021-06-05 21:43:22,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:22,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203509000] [2021-06-05 21:43:22,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:22,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:22,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203509000] [2021-06-05 21:43:22,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203509000] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:22,776 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:22,776 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:22,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705226230] [2021-06-05 21:43:22,776 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:22,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:22,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:22,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:22,777 INFO L87 Difference]: Start difference. First operand 158 states and 470 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:22,850 INFO L93 Difference]: Finished difference Result 259 states and 722 transitions. [2021-06-05 21:43:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:22,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:22,851 INFO L225 Difference]: With dead ends: 259 [2021-06-05 21:43:22,851 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 21:43:22,851 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.7ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 21:43:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 148. [2021-06-05 21:43:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.0136054421768708) internal successors, (443), 147 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 443 transitions. [2021-06-05 21:43:22,853 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 443 transitions. Word has length 16 [2021-06-05 21:43:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:22,854 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 443 transitions. [2021-06-05 21:43:22,854 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 443 transitions. [2021-06-05 21:43:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:22,854 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:22,854 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:22,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2021-06-05 21:43:22,854 INFO L430 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:22,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:22,854 INFO L82 PathProgramCache]: Analyzing trace with hash 105703180, now seen corresponding path program 41 times [2021-06-05 21:43:22,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:22,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078533471] [2021-06-05 21:43:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:22,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:22,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078533471] [2021-06-05 21:43:22,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078533471] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:22,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027569397] [2021-06-05 21:43:22,898 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:22,924 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:43:22,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:22,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:22,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:22,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027569397] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:22,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:22,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:43:22,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928375247] [2021-06-05 21:43:22,960 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:43:22,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:43:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:43:22,960 INFO L87 Difference]: Start difference. First operand 148 states and 443 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:23,043 INFO L93 Difference]: Finished difference Result 245 states and 701 transitions. [2021-06-05 21:43:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:23,044 INFO L225 Difference]: With dead ends: 245 [2021-06-05 21:43:23,044 INFO L226 Difference]: Without dead ends: 245 [2021-06-05 21:43:23,044 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-06-05 21:43:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 137. [2021-06-05 21:43:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0220588235294117) internal successors, (411), 136 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 411 transitions. [2021-06-05 21:43:23,046 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 411 transitions. Word has length 16 [2021-06-05 21:43:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:23,046 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 411 transitions. [2021-06-05 21:43:23,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 411 transitions. [2021-06-05 21:43:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:23,047 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:23,047 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:23,260 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable317 [2021-06-05 21:43:23,261 INFO L430 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:23,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:23,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1387314302, now seen corresponding path program 42 times [2021-06-05 21:43:23,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:23,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475156003] [2021-06-05 21:43:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:23,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:23,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475156003] [2021-06-05 21:43:23,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475156003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:23,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098376493] [2021-06-05 21:43:23,295 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:23,320 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:23,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:23,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:23,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:23,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098376493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:23,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:23,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:23,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365477752] [2021-06-05 21:43:23,362 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:23,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:23,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:23,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:23,362 INFO L87 Difference]: Start difference. First operand 137 states and 411 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:23,457 INFO L93 Difference]: Finished difference Result 240 states and 665 transitions. [2021-06-05 21:43:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:23,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:23,458 INFO L225 Difference]: With dead ends: 240 [2021-06-05 21:43:23,459 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 21:43:23,459 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 71.9ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 21:43:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2021-06-05 21:43:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.9776119402985075) internal successors, (399), 134 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 399 transitions. [2021-06-05 21:43:23,461 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 399 transitions. Word has length 16 [2021-06-05 21:43:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:23,462 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 399 transitions. [2021-06-05 21:43:23,462 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 399 transitions. [2021-06-05 21:43:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:23,462 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:23,462 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:23,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318,103 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:23,677 INFO L430 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:23,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:23,677 INFO L82 PathProgramCache]: Analyzing trace with hash -777157054, now seen corresponding path program 43 times [2021-06-05 21:43:23,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:23,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217908237] [2021-06-05 21:43:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:23,703 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:23,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217908237] [2021-06-05 21:43:23,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217908237] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:23,704 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023372858] [2021-06-05 21:43:23,704 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:23,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:23,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:23,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023372858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:23,770 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:23,770 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:23,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369947955] [2021-06-05 21:43:23,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:23,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:23,770 INFO L87 Difference]: Start difference. First operand 135 states and 399 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:23,875 INFO L93 Difference]: Finished difference Result 216 states and 610 transitions. [2021-06-05 21:43:23,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:23,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:23,876 INFO L225 Difference]: With dead ends: 216 [2021-06-05 21:43:23,876 INFO L226 Difference]: Without dead ends: 214 [2021-06-05 21:43:23,876 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 63.6ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-06-05 21:43:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 125. [2021-06-05 21:43:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.9919354838709675) internal successors, (371), 124 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 371 transitions. [2021-06-05 21:43:23,878 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 371 transitions. Word has length 16 [2021-06-05 21:43:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:23,878 INFO L482 AbstractCegarLoop]: Abstraction has 125 states and 371 transitions. [2021-06-05 21:43:23,878 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 371 transitions. [2021-06-05 21:43:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:23,878 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:23,878 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:24,078 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable319 [2021-06-05 21:43:24,079 INFO L430 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash 276142176, now seen corresponding path program 44 times [2021-06-05 21:43:24,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:24,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82641933] [2021-06-05 21:43:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:24,112 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:24,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82641933] [2021-06-05 21:43:24,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82641933] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:24,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074813416] [2021-06-05 21:43:24,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:24,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:24,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:24,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:24,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:24,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074813416] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:24,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:24,188 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:24,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598651366] [2021-06-05 21:43:24,188 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:24,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:24,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:24,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:24,188 INFO L87 Difference]: Start difference. First operand 125 states and 371 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:24,280 INFO L93 Difference]: Finished difference Result 197 states and 550 transitions. [2021-06-05 21:43:24,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:24,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:24,281 INFO L225 Difference]: With dead ends: 197 [2021-06-05 21:43:24,281 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 21:43:24,281 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 21:43:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 129. [2021-06-05 21:43:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0234375) internal successors, (387), 128 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 387 transitions. [2021-06-05 21:43:24,283 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 387 transitions. Word has length 16 [2021-06-05 21:43:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:24,283 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 387 transitions. [2021-06-05 21:43:24,283 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 387 transitions. [2021-06-05 21:43:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:24,283 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:24,283 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:24,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable322 [2021-06-05 21:43:24,497 INFO L430 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash 886299424, now seen corresponding path program 45 times [2021-06-05 21:43:24,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:24,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177949931] [2021-06-05 21:43:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:24,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:24,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177949931] [2021-06-05 21:43:24,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177949931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:24,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497401797] [2021-06-05 21:43:24,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:24,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:43:24,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:24,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:24,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:24,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497401797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:24,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:24,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:24,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108822509] [2021-06-05 21:43:24,603 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:24,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:24,603 INFO L87 Difference]: Start difference. First operand 129 states and 387 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:24,708 INFO L93 Difference]: Finished difference Result 199 states and 552 transitions. [2021-06-05 21:43:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:24,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:24,708 INFO L225 Difference]: With dead ends: 199 [2021-06-05 21:43:24,708 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 21:43:24,709 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 78.9ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 21:43:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2021-06-05 21:43:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 3.007936507936508) internal successors, (379), 126 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 379 transitions. [2021-06-05 21:43:24,710 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 379 transitions. Word has length 16 [2021-06-05 21:43:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:24,710 INFO L482 AbstractCegarLoop]: Abstraction has 127 states and 379 transitions. [2021-06-05 21:43:24,710 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 379 transitions. [2021-06-05 21:43:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:24,711 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:24,711 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:24,911 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable323 [2021-06-05 21:43:24,911 INFO L430 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1804249614, now seen corresponding path program 46 times [2021-06-05 21:43:24,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:24,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912176281] [2021-06-05 21:43:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:24,938 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:24,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912176281] [2021-06-05 21:43:24,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912176281] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:24,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423813532] [2021-06-05 21:43:24,938 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:24,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:43:24,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:24,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:24,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:25,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423813532] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:25,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:25,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:25,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678538572] [2021-06-05 21:43:25,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:25,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:25,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:25,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:25,024 INFO L87 Difference]: Start difference. First operand 127 states and 379 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:25,113 INFO L93 Difference]: Finished difference Result 178 states and 504 transitions. [2021-06-05 21:43:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:25,141 INFO L225 Difference]: With dead ends: 178 [2021-06-05 21:43:25,141 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 21:43:25,141 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 21:43:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2021-06-05 21:43:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 3.016260162601626) internal successors, (371), 123 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 371 transitions. [2021-06-05 21:43:25,143 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 371 transitions. Word has length 16 [2021-06-05 21:43:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:25,143 INFO L482 AbstractCegarLoop]: Abstraction has 124 states and 371 transitions. [2021-06-05 21:43:25,143 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 371 transitions. [2021-06-05 21:43:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:25,143 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:25,143 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:25,344 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326,107 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:25,344 INFO L430 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1122947330, now seen corresponding path program 41 times [2021-06-05 21:43:25,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:25,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963200121] [2021-06-05 21:43:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:25,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:25,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963200121] [2021-06-05 21:43:25,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963200121] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:25,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:25,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:25,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069053510] [2021-06-05 21:43:25,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:25,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:25,371 INFO L87 Difference]: Start difference. First operand 124 states and 371 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:25,440 INFO L93 Difference]: Finished difference Result 187 states and 507 transitions. [2021-06-05 21:43:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:25,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:25,441 INFO L225 Difference]: With dead ends: 187 [2021-06-05 21:43:25,441 INFO L226 Difference]: Without dead ends: 177 [2021-06-05 21:43:25,441 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.2ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-06-05 21:43:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 128. [2021-06-05 21:43:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.968503937007874) internal successors, (377), 127 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 377 transitions. [2021-06-05 21:43:25,443 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 377 transitions. Word has length 16 [2021-06-05 21:43:25,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:25,443 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 377 transitions. [2021-06-05 21:43:25,443 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 377 transitions. [2021-06-05 21:43:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:25,443 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:25,443 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:25,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2021-06-05 21:43:25,443 INFO L430 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -701314238, now seen corresponding path program 42 times [2021-06-05 21:43:25,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:25,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154899584] [2021-06-05 21:43:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:25,472 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:25,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154899584] [2021-06-05 21:43:25,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154899584] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:25,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:25,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:25,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220634711] [2021-06-05 21:43:25,472 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:25,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:25,472 INFO L87 Difference]: Start difference. First operand 128 states and 377 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:25,560 INFO L93 Difference]: Finished difference Result 195 states and 514 transitions. [2021-06-05 21:43:25,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:25,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:25,561 INFO L225 Difference]: With dead ends: 195 [2021-06-05 21:43:25,561 INFO L226 Difference]: Without dead ends: 191 [2021-06-05 21:43:25,561 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-06-05 21:43:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 134. [2021-06-05 21:43:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.924812030075188) internal successors, (389), 133 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 389 transitions. [2021-06-05 21:43:25,563 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 389 transitions. Word has length 16 [2021-06-05 21:43:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:25,563 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 389 transitions. [2021-06-05 21:43:25,563 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 389 transitions. [2021-06-05 21:43:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:25,563 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:25,563 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:25,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2021-06-05 21:43:25,563 INFO L430 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash -774686718, now seen corresponding path program 43 times [2021-06-05 21:43:25,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:25,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660961056] [2021-06-05 21:43:25,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:25,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:25,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660961056] [2021-06-05 21:43:25,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660961056] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:25,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:25,603 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:25,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65176347] [2021-06-05 21:43:25,603 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:25,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:25,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:25,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:25,604 INFO L87 Difference]: Start difference. First operand 134 states and 389 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:25,683 INFO L93 Difference]: Finished difference Result 180 states and 492 transitions. [2021-06-05 21:43:25,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:25,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:25,684 INFO L225 Difference]: With dead ends: 180 [2021-06-05 21:43:25,684 INFO L226 Difference]: Without dead ends: 175 [2021-06-05 21:43:25,684 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.8ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-06-05 21:43:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 126. [2021-06-05 21:43:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.984) internal successors, (373), 125 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 373 transitions. [2021-06-05 21:43:25,686 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 373 transitions. Word has length 16 [2021-06-05 21:43:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:25,686 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 373 transitions. [2021-06-05 21:43:25,686 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 373 transitions. [2021-06-05 21:43:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:25,686 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:25,686 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:25,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2021-06-05 21:43:25,686 INFO L430 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1714006770, now seen corresponding path program 44 times [2021-06-05 21:43:25,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:25,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294656264] [2021-06-05 21:43:25,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:25,728 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:25,728 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294656264] [2021-06-05 21:43:25,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294656264] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:25,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:25,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:25,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569396917] [2021-06-05 21:43:25,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:25,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:25,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:25,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:25,729 INFO L87 Difference]: Start difference. First operand 126 states and 373 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:25,821 INFO L93 Difference]: Finished difference Result 178 states and 483 transitions. [2021-06-05 21:43:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:25,822 INFO L225 Difference]: With dead ends: 178 [2021-06-05 21:43:25,822 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 21:43:25,822 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.6ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 21:43:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2021-06-05 21:43:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.9323308270676693) internal successors, (390), 133 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 390 transitions. [2021-06-05 21:43:25,824 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 390 transitions. Word has length 16 [2021-06-05 21:43:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:25,824 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 390 transitions. [2021-06-05 21:43:25,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 390 transitions. [2021-06-05 21:43:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:25,824 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:25,824 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:25,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2021-06-05 21:43:25,825 INFO L430 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1787379250, now seen corresponding path program 45 times [2021-06-05 21:43:25,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:25,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195769139] [2021-06-05 21:43:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:25,857 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:25,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195769139] [2021-06-05 21:43:25,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195769139] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:25,857 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:25,857 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:25,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440057806] [2021-06-05 21:43:25,857 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:25,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:25,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:25,858 INFO L87 Difference]: Start difference. First operand 134 states and 390 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:25,947 INFO L93 Difference]: Finished difference Result 176 states and 480 transitions. [2021-06-05 21:43:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:25,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:25,947 INFO L225 Difference]: With dead ends: 176 [2021-06-05 21:43:25,947 INFO L226 Difference]: Without dead ends: 173 [2021-06-05 21:43:25,947 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-06-05 21:43:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 133. [2021-06-05 21:43:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9318181818181817) internal successors, (387), 132 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 387 transitions. [2021-06-05 21:43:25,949 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 387 transitions. Word has length 16 [2021-06-05 21:43:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:25,949 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 387 transitions. [2021-06-05 21:43:25,949 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 387 transitions. [2021-06-05 21:43:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:25,952 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:25,952 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:25,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2021-06-05 21:43:25,953 INFO L430 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1784753474, now seen corresponding path program 46 times [2021-06-05 21:43:25,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:25,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334772504] [2021-06-05 21:43:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:25,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:25,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334772504] [2021-06-05 21:43:25,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334772504] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:25,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:25,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:25,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309466475] [2021-06-05 21:43:25,982 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:25,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:25,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:25,982 INFO L87 Difference]: Start difference. First operand 133 states and 387 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:26,043 INFO L93 Difference]: Finished difference Result 162 states and 458 transitions. [2021-06-05 21:43:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:26,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:26,045 INFO L225 Difference]: With dead ends: 162 [2021-06-05 21:43:26,045 INFO L226 Difference]: Without dead ends: 155 [2021-06-05 21:43:26,045 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-06-05 21:43:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124. [2021-06-05 21:43:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 3.0) internal successors, (369), 123 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 369 transitions. [2021-06-05 21:43:26,047 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 369 transitions. Word has length 16 [2021-06-05 21:43:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:26,047 INFO L482 AbstractCegarLoop]: Abstraction has 124 states and 369 transitions. [2021-06-05 21:43:26,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 369 transitions. [2021-06-05 21:43:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:26,047 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:26,047 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:26,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2021-06-05 21:43:26,047 INFO L430 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -829320514, now seen corresponding path program 47 times [2021-06-05 21:43:26,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:26,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17037407] [2021-06-05 21:43:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:26,108 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:26,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17037407] [2021-06-05 21:43:26,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17037407] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:26,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285547286] [2021-06-05 21:43:26,108 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:26,133 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:26,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:26,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:26,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:26,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285547286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:26,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:26,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:26,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046667160] [2021-06-05 21:43:26,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:26,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:26,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:26,209 INFO L87 Difference]: Start difference. First operand 124 states and 369 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:26,352 INFO L93 Difference]: Finished difference Result 206 states and 593 transitions. [2021-06-05 21:43:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:26,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:26,353 INFO L225 Difference]: With dead ends: 206 [2021-06-05 21:43:26,353 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 21:43:26,353 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 152.3ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:43:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 21:43:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 134. [2021-06-05 21:43:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1503759398496243) internal successors, (419), 133 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 419 transitions. [2021-06-05 21:43:26,355 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 419 transitions. Word has length 16 [2021-06-05 21:43:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:26,355 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 419 transitions. [2021-06-05 21:43:26,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 419 transitions. [2021-06-05 21:43:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:26,355 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:26,355 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:26,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable335 [2021-06-05 21:43:26,556 INFO L430 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash 365715660, now seen corresponding path program 47 times [2021-06-05 21:43:26,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:26,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740229074] [2021-06-05 21:43:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:26,587 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:26,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740229074] [2021-06-05 21:43:26,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740229074] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:26,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936983937] [2021-06-05 21:43:26,587 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:26,612 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:26,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:26,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:26,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:26,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936983937] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:26,672 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:26,672 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:26,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753861886] [2021-06-05 21:43:26,672 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:26,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:26,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:26,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:26,672 INFO L87 Difference]: Start difference. First operand 134 states and 419 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:26,776 INFO L93 Difference]: Finished difference Result 228 states and 642 transitions. [2021-06-05 21:43:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:26,777 INFO L225 Difference]: With dead ends: 228 [2021-06-05 21:43:26,777 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 21:43:26,777 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 75.3ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 21:43:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 143. [2021-06-05 21:43:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.1619718309859155) internal successors, (449), 142 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 449 transitions. [2021-06-05 21:43:26,780 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 449 transitions. Word has length 16 [2021-06-05 21:43:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:26,780 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 449 transitions. [2021-06-05 21:43:26,780 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 449 transitions. [2021-06-05 21:43:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:26,781 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:26,781 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:27,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336,109 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:27,003 INFO L430 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1794670766, now seen corresponding path program 48 times [2021-06-05 21:43:27,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:27,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999240172] [2021-06-05 21:43:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:27,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:27,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999240172] [2021-06-05 21:43:27,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999240172] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:27,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003776588] [2021-06-05 21:43:27,046 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:27,071 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:27,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:27,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:27,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:27,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003776588] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:27,135 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:27,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:27,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407745817] [2021-06-05 21:43:27,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:27,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:27,136 INFO L87 Difference]: Start difference. First operand 143 states and 449 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:27,287 INFO L93 Difference]: Finished difference Result 204 states and 583 transitions. [2021-06-05 21:43:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:27,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:27,288 INFO L225 Difference]: With dead ends: 204 [2021-06-05 21:43:27,288 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 21:43:27,288 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 138.0ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:43:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 21:43:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 146. [2021-06-05 21:43:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 3.117241379310345) internal successors, (452), 145 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 452 transitions. [2021-06-05 21:43:27,290 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 452 transitions. Word has length 16 [2021-06-05 21:43:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:27,290 INFO L482 AbstractCegarLoop]: Abstraction has 146 states and 452 transitions. [2021-06-05 21:43:27,290 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 452 transitions. [2021-06-05 21:43:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:27,290 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:27,290 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:27,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable339 [2021-06-05 21:43:27,491 INFO L430 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1574273086, now seen corresponding path program 48 times [2021-06-05 21:43:27,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:27,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561084581] [2021-06-05 21:43:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:27,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:27,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561084581] [2021-06-05 21:43:27,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561084581] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:27,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74376279] [2021-06-05 21:43:27,527 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:27,558 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:27,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:27,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:27,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:27,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74376279] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:27,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:27,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:27,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171824853] [2021-06-05 21:43:27,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:27,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:27,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:27,626 INFO L87 Difference]: Start difference. First operand 146 states and 452 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:27,746 INFO L93 Difference]: Finished difference Result 237 states and 668 transitions. [2021-06-05 21:43:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:27,747 INFO L225 Difference]: With dead ends: 237 [2021-06-05 21:43:27,747 INFO L226 Difference]: Without dead ends: 237 [2021-06-05 21:43:27,747 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 95.2ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-06-05 21:43:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 143. [2021-06-05 21:43:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.119718309859155) internal successors, (443), 142 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 443 transitions. [2021-06-05 21:43:27,750 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 443 transitions. Word has length 16 [2021-06-05 21:43:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:27,750 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 443 transitions. [2021-06-05 21:43:27,750 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 443 transitions. [2021-06-05 21:43:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:27,750 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:27,750 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:27,964 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable342 [2021-06-05 21:43:27,965 INFO L430 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash -486737002, now seen corresponding path program 49 times [2021-06-05 21:43:27,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:27,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726972395] [2021-06-05 21:43:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:27,999 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:27,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726972395] [2021-06-05 21:43:27,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726972395] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:27,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723592605] [2021-06-05 21:43:27,999 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:28,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:28,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:28,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723592605] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:28,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:28,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:28,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580357682] [2021-06-05 21:43:28,088 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:28,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:28,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:28,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:28,088 INFO L87 Difference]: Start difference. First operand 143 states and 443 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:28,171 INFO L93 Difference]: Finished difference Result 241 states and 680 transitions. [2021-06-05 21:43:28,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:28,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:28,171 INFO L225 Difference]: With dead ends: 241 [2021-06-05 21:43:28,171 INFO L226 Difference]: Without dead ends: 241 [2021-06-05 21:43:28,171 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.4ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-06-05 21:43:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 145. [2021-06-05 21:43:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1319444444444446) internal successors, (451), 144 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 451 transitions. [2021-06-05 21:43:28,173 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 451 transitions. Word has length 16 [2021-06-05 21:43:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:28,174 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 451 transitions. [2021-06-05 21:43:28,174 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 451 transitions. [2021-06-05 21:43:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:28,174 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:28,174 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:28,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable343 [2021-06-05 21:43:28,389 INFO L430 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1484976352, now seen corresponding path program 50 times [2021-06-05 21:43:28,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:28,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052305555] [2021-06-05 21:43:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:28,423 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:28,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052305555] [2021-06-05 21:43:28,423 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052305555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:28,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859051291] [2021-06-05 21:43:28,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:28,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:28,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:28,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:28,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:28,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859051291] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:28,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:28,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:28,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972459422] [2021-06-05 21:43:28,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:28,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:28,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:28,506 INFO L87 Difference]: Start difference. First operand 145 states and 451 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:28,584 INFO L93 Difference]: Finished difference Result 219 states and 626 transitions. [2021-06-05 21:43:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:28,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:28,584 INFO L225 Difference]: With dead ends: 219 [2021-06-05 21:43:28,584 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 21:43:28,584 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.4ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 21:43:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2021-06-05 21:43:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.119718309859155) internal successors, (443), 142 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 443 transitions. [2021-06-05 21:43:28,586 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 443 transitions. Word has length 16 [2021-06-05 21:43:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:28,586 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 443 transitions. [2021-06-05 21:43:28,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 443 transitions. [2021-06-05 21:43:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:28,587 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:28,587 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:28,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable344 [2021-06-05 21:43:28,787 INFO L430 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:28,788 INFO L82 PathProgramCache]: Analyzing trace with hash -375718014, now seen corresponding path program 49 times [2021-06-05 21:43:28,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:28,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576639690] [2021-06-05 21:43:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:28,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:28,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576639690] [2021-06-05 21:43:28,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576639690] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:28,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:28,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:28,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446194920] [2021-06-05 21:43:28,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:28,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:28,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:28,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:28,817 INFO L87 Difference]: Start difference. First operand 143 states and 443 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:28,888 INFO L93 Difference]: Finished difference Result 252 states and 683 transitions. [2021-06-05 21:43:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:28,888 INFO L225 Difference]: With dead ends: 252 [2021-06-05 21:43:28,888 INFO L226 Difference]: Without dead ends: 248 [2021-06-05 21:43:28,888 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-06-05 21:43:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 145. [2021-06-05 21:43:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1041666666666665) internal successors, (447), 144 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 447 transitions. [2021-06-05 21:43:28,890 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 447 transitions. Word has length 16 [2021-06-05 21:43:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:28,891 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 447 transitions. [2021-06-05 21:43:28,891 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 447 transitions. [2021-06-05 21:43:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:28,891 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:28,891 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:28,891 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2021-06-05 21:43:28,891 INFO L430 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash -449090494, now seen corresponding path program 50 times [2021-06-05 21:43:28,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:28,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609541226] [2021-06-05 21:43:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:28,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:28,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609541226] [2021-06-05 21:43:28,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609541226] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:28,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:28,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:28,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327992606] [2021-06-05 21:43:28,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:28,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:28,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:28,923 INFO L87 Difference]: Start difference. First operand 145 states and 447 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:28,998 INFO L93 Difference]: Finished difference Result 235 states and 657 transitions. [2021-06-05 21:43:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:28,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:28,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:28,998 INFO L225 Difference]: With dead ends: 235 [2021-06-05 21:43:28,998 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 21:43:28,999 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 21:43:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 144. [2021-06-05 21:43:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.104895104895105) internal successors, (444), 143 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 444 transitions. [2021-06-05 21:43:29,001 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 444 transitions. Word has length 16 [2021-06-05 21:43:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:29,001 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 444 transitions. [2021-06-05 21:43:29,001 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 444 transitions. [2021-06-05 21:43:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:29,001 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:29,001 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:29,001 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2021-06-05 21:43:29,002 INFO L430 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1114797280, now seen corresponding path program 51 times [2021-06-05 21:43:29,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:29,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480470563] [2021-06-05 21:43:29,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:29,034 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:29,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480470563] [2021-06-05 21:43:29,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480470563] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:29,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:29,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:29,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113592684] [2021-06-05 21:43:29,035 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:29,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:29,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:29,035 INFO L87 Difference]: Start difference. First operand 144 states and 444 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:29,137 INFO L93 Difference]: Finished difference Result 221 states and 606 transitions. [2021-06-05 21:43:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:29,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:29,137 INFO L225 Difference]: With dead ends: 221 [2021-06-05 21:43:29,137 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 21:43:29,137 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 75.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 21:43:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 146. [2021-06-05 21:43:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 3.089655172413793) internal successors, (448), 145 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 448 transitions. [2021-06-05 21:43:29,139 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 448 transitions. Word has length 16 [2021-06-05 21:43:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:29,139 INFO L482 AbstractCegarLoop]: Abstraction has 146 states and 448 transitions. [2021-06-05 21:43:29,139 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 448 transitions. [2021-06-05 21:43:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:29,140 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:29,140 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:29,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2021-06-05 21:43:29,140 INFO L430 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:29,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:29,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2082842440, now seen corresponding path program 52 times [2021-06-05 21:43:29,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:29,140 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391385593] [2021-06-05 21:43:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:29,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:29,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391385593] [2021-06-05 21:43:29,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391385593] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:29,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:29,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:29,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103905297] [2021-06-05 21:43:29,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:29,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:29,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:29,169 INFO L87 Difference]: Start difference. First operand 146 states and 448 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:29,271 INFO L93 Difference]: Finished difference Result 207 states and 585 transitions. [2021-06-05 21:43:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:29,272 INFO L225 Difference]: With dead ends: 207 [2021-06-05 21:43:29,272 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 21:43:29,272 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 21:43:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 145. [2021-06-05 21:43:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0902777777777777) internal successors, (445), 144 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 445 transitions. [2021-06-05 21:43:29,274 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 445 transitions. Word has length 16 [2021-06-05 21:43:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:29,274 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 445 transitions. [2021-06-05 21:43:29,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 445 transitions. [2021-06-05 21:43:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:29,274 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:29,274 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:29,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2021-06-05 21:43:29,274 INFO L430 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1272791022, now seen corresponding path program 51 times [2021-06-05 21:43:29,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:29,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967948182] [2021-06-05 21:43:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:29,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:29,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967948182] [2021-06-05 21:43:29,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967948182] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:29,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006907461] [2021-06-05 21:43:29,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:29,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:43:29,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:29,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:29,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:29,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006907461] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:29,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:29,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:29,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065913776] [2021-06-05 21:43:29,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:29,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:29,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:29,402 INFO L87 Difference]: Start difference. First operand 145 states and 445 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:29,496 INFO L93 Difference]: Finished difference Result 271 states and 747 transitions. [2021-06-05 21:43:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:29,496 INFO L225 Difference]: With dead ends: 271 [2021-06-05 21:43:29,496 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 21:43:29,497 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 85.5ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 21:43:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 147. [2021-06-05 21:43:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.1027397260273974) internal successors, (453), 146 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 453 transitions. [2021-06-05 21:43:29,499 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 453 transitions. Word has length 16 [2021-06-05 21:43:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:29,499 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 453 transitions. [2021-06-05 21:43:29,499 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 453 transitions. [2021-06-05 21:43:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:29,499 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:29,500 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:29,704 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351,114 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:29,705 INFO L430 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:29,705 INFO L82 PathProgramCache]: Analyzing trace with hash 88765084, now seen corresponding path program 52 times [2021-06-05 21:43:29,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:29,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824578574] [2021-06-05 21:43:29,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:29,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:29,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824578574] [2021-06-05 21:43:29,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824578574] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:29,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:29,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:29,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955595833] [2021-06-05 21:43:29,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:29,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:29,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:29,743 INFO L87 Difference]: Start difference. First operand 147 states and 453 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:29,832 INFO L93 Difference]: Finished difference Result 245 states and 683 transitions. [2021-06-05 21:43:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:29,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:29,833 INFO L225 Difference]: With dead ends: 245 [2021-06-05 21:43:29,833 INFO L226 Difference]: Without dead ends: 243 [2021-06-05 21:43:29,833 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 47.8ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-06-05 21:43:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 144. [2021-06-05 21:43:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.090909090909091) internal successors, (442), 143 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 442 transitions. [2021-06-05 21:43:29,835 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 442 transitions. Word has length 16 [2021-06-05 21:43:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:29,835 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 442 transitions. [2021-06-05 21:43:29,835 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 442 transitions. [2021-06-05 21:43:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:29,836 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:29,836 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:29,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2021-06-05 21:43:29,836 INFO L430 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1701446174, now seen corresponding path program 53 times [2021-06-05 21:43:29,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:29,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363059318] [2021-06-05 21:43:29,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:29,868 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:29,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363059318] [2021-06-05 21:43:29,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363059318] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:29,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458118070] [2021-06-05 21:43:29,869 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:29,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:43:29,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:29,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:29,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:29,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458118070] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:29,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:29,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:29,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863645725] [2021-06-05 21:43:29,953 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:29,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:29,954 INFO L87 Difference]: Start difference. First operand 144 states and 442 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:30,044 INFO L93 Difference]: Finished difference Result 215 states and 605 transitions. [2021-06-05 21:43:30,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:30,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:30,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:30,044 INFO L225 Difference]: With dead ends: 215 [2021-06-05 21:43:30,045 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 21:43:30,045 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 21:43:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2021-06-05 21:43:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.0492957746478875) internal successors, (433), 142 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 433 transitions. [2021-06-05 21:43:30,046 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 433 transitions. Word has length 16 [2021-06-05 21:43:30,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:30,047 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 433 transitions. [2021-06-05 21:43:30,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 433 transitions. [2021-06-05 21:43:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:30,047 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:30,047 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:30,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353,115 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:30,247 INFO L430 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:30,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash -621807768, now seen corresponding path program 54 times [2021-06-05 21:43:30,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:30,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939585266] [2021-06-05 21:43:30,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:30,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:30,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939585266] [2021-06-05 21:43:30,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939585266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:30,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148552561] [2021-06-05 21:43:30,279 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:30,304 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:30,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:30,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:30,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:30,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148552561] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:30,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:30,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:30,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623317417] [2021-06-05 21:43:30,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:30,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:30,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:30,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:30,363 INFO L87 Difference]: Start difference. First operand 143 states and 433 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:30,443 INFO L93 Difference]: Finished difference Result 206 states and 578 transitions. [2021-06-05 21:43:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:30,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:30,444 INFO L225 Difference]: With dead ends: 206 [2021-06-05 21:43:30,444 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 21:43:30,444 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 21:43:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 137. [2021-06-05 21:43:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0661764705882355) internal successors, (417), 136 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 417 transitions. [2021-06-05 21:43:30,446 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 417 transitions. Word has length 16 [2021-06-05 21:43:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:30,446 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 417 transitions. [2021-06-05 21:43:30,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 417 transitions. [2021-06-05 21:43:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:30,446 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:30,446 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:30,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable354 [2021-06-05 21:43:30,661 INFO L430 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -239087380, now seen corresponding path program 55 times [2021-06-05 21:43:30,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:30,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133054135] [2021-06-05 21:43:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:30,687 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:30,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133054135] [2021-06-05 21:43:30,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133054135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:30,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476671020] [2021-06-05 21:43:30,688 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:30,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:30,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:30,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476671020] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:30,758 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:30,758 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:30,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501909778] [2021-06-05 21:43:30,758 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:30,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:30,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:30,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:30,759 INFO L87 Difference]: Start difference. First operand 137 states and 417 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:30,840 INFO L93 Difference]: Finished difference Result 185 states and 529 transitions. [2021-06-05 21:43:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:30,840 INFO L225 Difference]: With dead ends: 185 [2021-06-05 21:43:30,840 INFO L226 Difference]: Without dead ends: 181 [2021-06-05 21:43:30,840 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-06-05 21:43:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135. [2021-06-05 21:43:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 3.0522388059701493) internal successors, (409), 134 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 409 transitions. [2021-06-05 21:43:30,842 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 409 transitions. Word has length 16 [2021-06-05 21:43:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:30,842 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 409 transitions. [2021-06-05 21:43:30,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 409 transitions. [2021-06-05 21:43:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:30,843 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:30,843 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:31,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357,117 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:31,043 INFO L430 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash 212027308, now seen corresponding path program 53 times [2021-06-05 21:43:31,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:31,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124936427] [2021-06-05 21:43:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:31,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:31,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124936427] [2021-06-05 21:43:31,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124936427] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:31,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:31,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:31,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202766770] [2021-06-05 21:43:31,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:31,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:31,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:31,094 INFO L87 Difference]: Start difference. First operand 135 states and 409 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:31,176 INFO L93 Difference]: Finished difference Result 213 states and 580 transitions. [2021-06-05 21:43:31,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:31,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:31,176 INFO L225 Difference]: With dead ends: 213 [2021-06-05 21:43:31,176 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 21:43:31,177 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 58.2ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 21:43:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 139. [2021-06-05 21:43:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.028985507246377) internal successors, (418), 138 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 418 transitions. [2021-06-05 21:43:31,179 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 418 transitions. Word has length 16 [2021-06-05 21:43:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:31,179 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 418 transitions. [2021-06-05 21:43:31,179 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 418 transitions. [2021-06-05 21:43:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:31,180 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:31,180 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:31,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2021-06-05 21:43:31,180 INFO L430 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash 138654828, now seen corresponding path program 54 times [2021-06-05 21:43:31,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:31,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470006190] [2021-06-05 21:43:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:31,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:31,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470006190] [2021-06-05 21:43:31,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470006190] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:31,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:31,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:31,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356877242] [2021-06-05 21:43:31,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:31,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:31,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:31,213 INFO L87 Difference]: Start difference. First operand 139 states and 418 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:31,312 INFO L93 Difference]: Finished difference Result 211 states and 577 transitions. [2021-06-05 21:43:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:31,313 INFO L225 Difference]: With dead ends: 211 [2021-06-05 21:43:31,313 INFO L226 Difference]: Without dead ends: 208 [2021-06-05 21:43:31,313 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 57.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-06-05 21:43:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 137. [2021-06-05 21:43:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.036764705882353) internal successors, (413), 136 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 413 transitions. [2021-06-05 21:43:31,315 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 413 transitions. Word has length 16 [2021-06-05 21:43:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:31,315 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 413 transitions. [2021-06-05 21:43:31,315 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 413 transitions. [2021-06-05 21:43:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:31,316 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:31,316 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:31,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2021-06-05 21:43:31,316 INFO L430 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash 141280604, now seen corresponding path program 55 times [2021-06-05 21:43:31,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:31,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873598810] [2021-06-05 21:43:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:31,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:31,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873598810] [2021-06-05 21:43:31,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873598810] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:31,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:31,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:31,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018349243] [2021-06-05 21:43:31,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:31,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:31,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:31,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:31,348 INFO L87 Difference]: Start difference. First operand 137 states and 413 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:31,421 INFO L93 Difference]: Finished difference Result 199 states and 559 transitions. [2021-06-05 21:43:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:31,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:31,422 INFO L225 Difference]: With dead ends: 199 [2021-06-05 21:43:31,422 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 21:43:31,422 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 21:43:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2021-06-05 21:43:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.037037037037037) internal successors, (410), 135 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 410 transitions. [2021-06-05 21:43:31,425 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 410 transitions. Word has length 16 [2021-06-05 21:43:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:31,425 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 410 transitions. [2021-06-05 21:43:31,425 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 410 transitions. [2021-06-05 21:43:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:31,425 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:31,425 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:31,425 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2021-06-05 21:43:31,425 INFO L430 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash 567039630, now seen corresponding path program 56 times [2021-06-05 21:43:31,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:31,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598958873] [2021-06-05 21:43:31,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:31,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:31,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598958873] [2021-06-05 21:43:31,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598958873] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:31,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:31,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:31,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227315803] [2021-06-05 21:43:31,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:31,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:31,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:31,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:31,459 INFO L87 Difference]: Start difference. First operand 136 states and 410 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:31,574 INFO L93 Difference]: Finished difference Result 169 states and 478 transitions. [2021-06-05 21:43:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:31,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:31,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:31,575 INFO L225 Difference]: With dead ends: 169 [2021-06-05 21:43:31,575 INFO L226 Difference]: Without dead ends: 166 [2021-06-05 21:43:31,575 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 92.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-06-05 21:43:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143. [2021-06-05 21:43:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.992957746478873) internal successors, (425), 142 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 425 transitions. [2021-06-05 21:43:31,578 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 425 transitions. Word has length 16 [2021-06-05 21:43:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:31,578 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 425 transitions. [2021-06-05 21:43:31,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 425 transitions. [2021-06-05 21:43:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:31,578 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:31,578 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:31,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2021-06-05 21:43:31,579 INFO L430 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash -530287946, now seen corresponding path program 57 times [2021-06-05 21:43:31,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:31,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341335849] [2021-06-05 21:43:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:31,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:31,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341335849] [2021-06-05 21:43:31,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341335849] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:31,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:31,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:31,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791844343] [2021-06-05 21:43:31,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:31,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:31,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:31,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:31,612 INFO L87 Difference]: Start difference. First operand 143 states and 425 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:31,719 INFO L93 Difference]: Finished difference Result 168 states and 476 transitions. [2021-06-05 21:43:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:31,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:31,720 INFO L225 Difference]: With dead ends: 168 [2021-06-05 21:43:31,720 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 21:43:31,720 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 21:43:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2021-06-05 21:43:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.99290780141844) internal successors, (422), 141 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 422 transitions. [2021-06-05 21:43:31,721 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 422 transitions. Word has length 16 [2021-06-05 21:43:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:31,722 INFO L482 AbstractCegarLoop]: Abstraction has 142 states and 422 transitions. [2021-06-05 21:43:31,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 422 transitions. [2021-06-05 21:43:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:31,722 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:31,722 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:31,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2021-06-05 21:43:31,722 INFO L430 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1618508590, now seen corresponding path program 58 times [2021-06-05 21:43:31,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:31,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718438841] [2021-06-05 21:43:31,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:31,749 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:31,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718438841] [2021-06-05 21:43:31,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718438841] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:31,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:31,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:31,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488786873] [2021-06-05 21:43:31,749 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:31,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:31,750 INFO L87 Difference]: Start difference. First operand 142 states and 422 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:31,837 INFO L93 Difference]: Finished difference Result 155 states and 456 transitions. [2021-06-05 21:43:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:31,838 INFO L225 Difference]: With dead ends: 155 [2021-06-05 21:43:31,838 INFO L226 Difference]: Without dead ends: 150 [2021-06-05 21:43:31,838 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-06-05 21:43:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2021-06-05 21:43:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0296296296296297) internal successors, (409), 135 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 409 transitions. [2021-06-05 21:43:31,840 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 409 transitions. Word has length 16 [2021-06-05 21:43:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:31,840 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 409 transitions. [2021-06-05 21:43:31,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 409 transitions. [2021-06-05 21:43:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:31,840 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:31,840 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:31,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2021-06-05 21:43:31,840 INFO L430 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1191391966, now seen corresponding path program 56 times [2021-06-05 21:43:31,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:31,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850999623] [2021-06-05 21:43:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:31,874 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:31,875 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850999623] [2021-06-05 21:43:31,875 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850999623] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:31,875 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828112798] [2021-06-05 21:43:31,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:31,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:31,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:31,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:31,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:31,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828112798] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:31,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:31,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:31,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813663202] [2021-06-05 21:43:31,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:31,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:31,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:31,958 INFO L87 Difference]: Start difference. First operand 136 states and 409 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:32,047 INFO L93 Difference]: Finished difference Result 201 states and 566 transitions. [2021-06-05 21:43:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:32,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:32,048 INFO L225 Difference]: With dead ends: 201 [2021-06-05 21:43:32,048 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 21:43:32,048 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 86.5ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 21:43:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2021-06-05 21:43:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.985074626865672) internal successors, (400), 134 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 400 transitions. [2021-06-05 21:43:32,049 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 400 transitions. Word has length 16 [2021-06-05 21:43:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:32,049 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 400 transitions. [2021-06-05 21:43:32,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 400 transitions. [2021-06-05 21:43:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:32,050 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:32,050 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:32,250 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable366 [2021-06-05 21:43:32,250 INFO L430 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash 170164140, now seen corresponding path program 57 times [2021-06-05 21:43:32,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:32,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837753116] [2021-06-05 21:43:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:32,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:32,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837753116] [2021-06-05 21:43:32,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837753116] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:32,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:32,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:32,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967959693] [2021-06-05 21:43:32,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:32,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:32,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:32,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:32,289 INFO L87 Difference]: Start difference. First operand 135 states and 400 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:32,369 INFO L93 Difference]: Finished difference Result 197 states and 549 transitions. [2021-06-05 21:43:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:32,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:32,369 INFO L225 Difference]: With dead ends: 197 [2021-06-05 21:43:32,369 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 21:43:32,369 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 21:43:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 133. [2021-06-05 21:43:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9696969696969697) internal successors, (392), 132 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 392 transitions. [2021-06-05 21:43:32,371 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 392 transitions. Word has length 16 [2021-06-05 21:43:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:32,371 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 392 transitions. [2021-06-05 21:43:32,371 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 392 transitions. [2021-06-05 21:43:32,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:32,372 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:32,372 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:32,372 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2021-06-05 21:43:32,372 INFO L430 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash -365065662, now seen corresponding path program 58 times [2021-06-05 21:43:32,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:32,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829929519] [2021-06-05 21:43:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:32,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:32,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829929519] [2021-06-05 21:43:32,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829929519] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:32,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:32,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:32,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588418893] [2021-06-05 21:43:32,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:32,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:32,398 INFO L87 Difference]: Start difference. First operand 133 states and 392 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:32,465 INFO L93 Difference]: Finished difference Result 174 states and 499 transitions. [2021-06-05 21:43:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:32,465 INFO L225 Difference]: With dead ends: 174 [2021-06-05 21:43:32,465 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 21:43:32,465 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 21:43:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2021-06-05 21:43:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 3.008) internal successors, (376), 125 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 376 transitions. [2021-06-05 21:43:32,467 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 376 transitions. Word has length 16 [2021-06-05 21:43:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:32,467 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 376 transitions. [2021-06-05 21:43:32,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 376 transitions. [2021-06-05 21:43:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:32,467 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:32,467 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:32,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2021-06-05 21:43:32,467 INFO L430 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:32,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash -559894012, now seen corresponding path program 59 times [2021-06-05 21:43:32,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:32,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988217835] [2021-06-05 21:43:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:32,515 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:32,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988217835] [2021-06-05 21:43:32,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988217835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:32,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146033330] [2021-06-05 21:43:32,515 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:32,540 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:32,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:32,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:32,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:32,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146033330] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:32,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:32,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:32,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804204325] [2021-06-05 21:43:32,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:32,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:32,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:32,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:32,605 INFO L87 Difference]: Start difference. First operand 126 states and 376 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:32,690 INFO L93 Difference]: Finished difference Result 200 states and 564 transitions. [2021-06-05 21:43:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:32,690 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:32,690 INFO L225 Difference]: With dead ends: 200 [2021-06-05 21:43:32,690 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 21:43:32,690 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 21:43:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 129. [2021-06-05 21:43:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0546875) internal successors, (391), 128 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 391 transitions. [2021-06-05 21:43:32,692 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 391 transitions. Word has length 16 [2021-06-05 21:43:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:32,692 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 391 transitions. [2021-06-05 21:43:32,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 391 transitions. [2021-06-05 21:43:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:32,693 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:32,693 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:32,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable369 [2021-06-05 21:43:32,893 INFO L430 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:32,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:32,893 INFO L82 PathProgramCache]: Analyzing trace with hash 635142162, now seen corresponding path program 59 times [2021-06-05 21:43:32,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:32,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229858746] [2021-06-05 21:43:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:32,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:32,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229858746] [2021-06-05 21:43:32,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229858746] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:32,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76650826] [2021-06-05 21:43:32,927 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:32,958 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:32,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:32,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:32,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:33,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76650826] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:33,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:33,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:33,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434162726] [2021-06-05 21:43:33,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:33,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:33,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:33,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:33,007 INFO L87 Difference]: Start difference. First operand 129 states and 391 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:33,098 INFO L93 Difference]: Finished difference Result 199 states and 565 transitions. [2021-06-05 21:43:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:33,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:33,099 INFO L225 Difference]: With dead ends: 199 [2021-06-05 21:43:33,099 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 21:43:33,099 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 21:43:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 136. [2021-06-05 21:43:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0444444444444443) internal successors, (411), 135 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 411 transitions. [2021-06-05 21:43:33,102 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 411 transitions. Word has length 16 [2021-06-05 21:43:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:33,102 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 411 transitions. [2021-06-05 21:43:33,102 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 411 transitions. [2021-06-05 21:43:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:33,102 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:33,102 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:33,323 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370,120 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:33,323 INFO L430 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2064097268, now seen corresponding path program 60 times [2021-06-05 21:43:33,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:33,324 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084373754] [2021-06-05 21:43:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:33,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:33,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084373754] [2021-06-05 21:43:33,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084373754] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:33,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361724330] [2021-06-05 21:43:33,365 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:33,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:33,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:33,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:33,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:33,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361724330] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:33,467 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:33,467 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:33,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889399981] [2021-06-05 21:43:33,467 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:33,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:33,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:33,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:33,468 INFO L87 Difference]: Start difference. First operand 136 states and 411 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:33,546 INFO L93 Difference]: Finished difference Result 206 states and 579 transitions. [2021-06-05 21:43:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:33,546 INFO L225 Difference]: With dead ends: 206 [2021-06-05 21:43:33,546 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 21:43:33,546 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 90.6ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 21:43:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 136. [2021-06-05 21:43:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.022222222222222) internal successors, (408), 135 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 408 transitions. [2021-06-05 21:43:33,548 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 408 transitions. Word has length 16 [2021-06-05 21:43:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:33,548 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 408 transitions. [2021-06-05 21:43:33,548 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 408 transitions. [2021-06-05 21:43:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:33,549 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:33,549 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:33,756 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373,121 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:33,757 INFO L430 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1304846584, now seen corresponding path program 60 times [2021-06-05 21:43:33,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:33,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795483982] [2021-06-05 21:43:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:33,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:33,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795483982] [2021-06-05 21:43:33,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795483982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:33,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794834524] [2021-06-05 21:43:33,786 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:33,810 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:33,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:33,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:33,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:33,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794834524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:33,852 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:33,852 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:33,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063883869] [2021-06-05 21:43:33,852 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:33,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:33,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:33,852 INFO L87 Difference]: Start difference. First operand 136 states and 408 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:33,938 INFO L93 Difference]: Finished difference Result 201 states and 573 transitions. [2021-06-05 21:43:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:33,939 INFO L225 Difference]: With dead ends: 201 [2021-06-05 21:43:33,939 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 21:43:33,939 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 21:43:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2021-06-05 21:43:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.022727272727273) internal successors, (399), 132 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 399 transitions. [2021-06-05 21:43:33,941 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 399 transitions. Word has length 16 [2021-06-05 21:43:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:33,941 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 399 transitions. [2021-06-05 21:43:33,941 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 399 transitions. [2021-06-05 21:43:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:33,941 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:33,941 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:34,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable376 [2021-06-05 21:43:34,159 INFO L430 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:34,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:34,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1190356588, now seen corresponding path program 61 times [2021-06-05 21:43:34,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:34,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142109859] [2021-06-05 21:43:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:34,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:34,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142109859] [2021-06-05 21:43:34,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142109859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:34,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014996601] [2021-06-05 21:43:34,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:34,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:34,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:34,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014996601] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:34,263 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:34,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:34,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229590593] [2021-06-05 21:43:34,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:34,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:34,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:34,264 INFO L87 Difference]: Start difference. First operand 133 states and 399 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:34,349 INFO L93 Difference]: Finished difference Result 199 states and 553 transitions. [2021-06-05 21:43:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:34,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:34,350 INFO L225 Difference]: With dead ends: 199 [2021-06-05 21:43:34,350 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 21:43:34,350 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 21:43:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 133. [2021-06-05 21:43:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.0) internal successors, (396), 132 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 396 transitions. [2021-06-05 21:43:34,352 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 396 transitions. Word has length 16 [2021-06-05 21:43:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:34,352 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 396 transitions. [2021-06-05 21:43:34,352 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 396 transitions. [2021-06-05 21:43:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:34,352 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:34,353 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:34,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377,123 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:34,557 INFO L430 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1323280610, now seen corresponding path program 61 times [2021-06-05 21:43:34,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:34,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054043943] [2021-06-05 21:43:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:34,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:34,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054043943] [2021-06-05 21:43:34,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054043943] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:34,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048410769] [2021-06-05 21:43:34,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:34,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:34,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:34,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048410769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:34,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:34,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:43:34,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928669855] [2021-06-05 21:43:34,654 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:43:34,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:43:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:43:34,654 INFO L87 Difference]: Start difference. First operand 133 states and 396 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:34,735 INFO L93 Difference]: Finished difference Result 220 states and 636 transitions. [2021-06-05 21:43:34,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:34,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:34,736 INFO L225 Difference]: With dead ends: 220 [2021-06-05 21:43:34,736 INFO L226 Difference]: Without dead ends: 220 [2021-06-05 21:43:34,736 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 55.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-06-05 21:43:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 130. [2021-06-05 21:43:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 3.0) internal successors, (387), 129 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 387 transitions. [2021-06-05 21:43:34,738 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 387 transitions. Word has length 16 [2021-06-05 21:43:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:34,738 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 387 transitions. [2021-06-05 21:43:34,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 387 transitions. [2021-06-05 21:43:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:34,738 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:34,738 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:34,938 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380,124 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:34,938 INFO L430 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:34,939 INFO L82 PathProgramCache]: Analyzing trace with hash 715054666, now seen corresponding path program 62 times [2021-06-05 21:43:34,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:34,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188876748] [2021-06-05 21:43:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:34,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:34,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188876748] [2021-06-05 21:43:34,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188876748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:34,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238855288] [2021-06-05 21:43:34,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:35,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:35,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:35,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:35,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:35,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238855288] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:35,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:35,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:35,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310159276] [2021-06-05 21:43:35,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:35,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:35,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:35,105 INFO L87 Difference]: Start difference. First operand 130 states and 387 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:35,283 INFO L93 Difference]: Finished difference Result 267 states and 740 transitions. [2021-06-05 21:43:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:35,283 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:35,284 INFO L225 Difference]: With dead ends: 267 [2021-06-05 21:43:35,284 INFO L226 Difference]: Without dead ends: 267 [2021-06-05 21:43:35,284 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 163.9ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:43:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-06-05 21:43:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 138. [2021-06-05 21:43:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.116788321167883) internal successors, (427), 137 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 427 transitions. [2021-06-05 21:43:35,286 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 427 transitions. Word has length 16 [2021-06-05 21:43:35,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:35,286 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 427 transitions. [2021-06-05 21:43:35,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 427 transitions. [2021-06-05 21:43:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:35,286 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:35,286 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:35,487 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381,125 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:35,487 INFO L430 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1910090840, now seen corresponding path program 62 times [2021-06-05 21:43:35,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:35,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339018417] [2021-06-05 21:43:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:35,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:35,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339018417] [2021-06-05 21:43:35,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339018417] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:35,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423938927] [2021-06-05 21:43:35,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:35,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:35,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:35,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:35,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:35,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423938927] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:35,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:35,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:35,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296104265] [2021-06-05 21:43:35,629 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:35,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:35,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:35,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:35,630 INFO L87 Difference]: Start difference. First operand 138 states and 427 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:35,802 INFO L93 Difference]: Finished difference Result 271 states and 760 transitions. [2021-06-05 21:43:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:35,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:35,803 INFO L225 Difference]: With dead ends: 271 [2021-06-05 21:43:35,803 INFO L226 Difference]: Without dead ends: 267 [2021-06-05 21:43:35,803 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 156.8ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:43:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-06-05 21:43:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 142. [2021-06-05 21:43:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 3.148936170212766) internal successors, (444), 141 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 444 transitions. [2021-06-05 21:43:35,805 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 444 transitions. Word has length 16 [2021-06-05 21:43:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:35,805 INFO L482 AbstractCegarLoop]: Abstraction has 142 states and 444 transitions. [2021-06-05 21:43:35,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 444 transitions. [2021-06-05 21:43:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:35,805 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:35,805 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:36,006 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382,126 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:36,006 INFO L430 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:36,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:36,006 INFO L82 PathProgramCache]: Analyzing trace with hash -955921350, now seen corresponding path program 63 times [2021-06-05 21:43:36,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:36,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503011511] [2021-06-05 21:43:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:36,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:36,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503011511] [2021-06-05 21:43:36,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503011511] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:36,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125821555] [2021-06-05 21:43:36,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:36,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:43:36,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:36,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:36,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:36,139 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125821555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:36,139 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:36,139 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:36,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587111062] [2021-06-05 21:43:36,140 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:36,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:36,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:36,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:36,140 INFO L87 Difference]: Start difference. First operand 142 states and 444 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:36,289 INFO L93 Difference]: Finished difference Result 260 states and 717 transitions. [2021-06-05 21:43:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:36,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:36,289 INFO L225 Difference]: With dead ends: 260 [2021-06-05 21:43:36,289 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 21:43:36,289 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 147.3ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:43:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 21:43:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 145. [2021-06-05 21:43:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1041666666666665) internal successors, (447), 144 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 447 transitions. [2021-06-05 21:43:36,291 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 447 transitions. Word has length 16 [2021-06-05 21:43:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:36,292 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 447 transitions. [2021-06-05 21:43:36,292 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 447 transitions. [2021-06-05 21:43:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:36,292 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:36,292 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:36,492 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385,127 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:36,492 INFO L430 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:36,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash -29897906, now seen corresponding path program 63 times [2021-06-05 21:43:36,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:36,493 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002753842] [2021-06-05 21:43:36,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:36,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:36,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002753842] [2021-06-05 21:43:36,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002753842] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:36,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525643439] [2021-06-05 21:43:36,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:36,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:43:36,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:36,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:36,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:36,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525643439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:36,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:36,624 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:36,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376545438] [2021-06-05 21:43:36,624 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:36,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:36,624 INFO L87 Difference]: Start difference. First operand 145 states and 447 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:36,810 INFO L93 Difference]: Finished difference Result 278 states and 788 transitions. [2021-06-05 21:43:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:36,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:36,811 INFO L225 Difference]: With dead ends: 278 [2021-06-05 21:43:36,811 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 21:43:36,811 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 154.2ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:43:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 21:43:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 139. [2021-06-05 21:43:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.0652173913043477) internal successors, (423), 138 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 423 transitions. [2021-06-05 21:43:36,813 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 423 transitions. Word has length 16 [2021-06-05 21:43:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:36,813 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 423 transitions. [2021-06-05 21:43:36,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 423 transitions. [2021-06-05 21:43:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:36,814 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:36,814 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:37,014 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable388 [2021-06-05 21:43:37,014 INFO L430 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:37,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1057638178, now seen corresponding path program 64 times [2021-06-05 21:43:37,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:37,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024180603] [2021-06-05 21:43:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:37,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:37,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024180603] [2021-06-05 21:43:37,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024180603] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:37,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092942966] [2021-06-05 21:43:37,048 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:37,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:43:37,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:37,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:37,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:37,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092942966] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:37,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:37,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:37,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722482507] [2021-06-05 21:43:37,157 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:37,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:37,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:37,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:37,157 INFO L87 Difference]: Start difference. First operand 139 states and 423 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:37,255 INFO L93 Difference]: Finished difference Result 239 states and 660 transitions. [2021-06-05 21:43:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:37,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:37,256 INFO L225 Difference]: With dead ends: 239 [2021-06-05 21:43:37,256 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 21:43:37,256 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 81.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 21:43:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 134. [2021-06-05 21:43:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.045112781954887) internal successors, (405), 133 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 405 transitions. [2021-06-05 21:43:37,258 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 405 transitions. Word has length 16 [2021-06-05 21:43:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:37,258 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 405 transitions. [2021-06-05 21:43:37,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 405 transitions. [2021-06-05 21:43:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:37,258 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:37,258 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:37,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable389 [2021-06-05 21:43:37,459 INFO L430 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1265615764, now seen corresponding path program 65 times [2021-06-05 21:43:37,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:37,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306138331] [2021-06-05 21:43:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:37,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:37,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306138331] [2021-06-05 21:43:37,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306138331] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:37,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410255180] [2021-06-05 21:43:37,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:37,530 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:37,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:37,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:37,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:37,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410255180] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:37,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:37,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:37,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286683700] [2021-06-05 21:43:37,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:37,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:37,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:37,591 INFO L87 Difference]: Start difference. First operand 134 states and 405 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:37,677 INFO L93 Difference]: Finished difference Result 217 states and 606 transitions. [2021-06-05 21:43:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:37,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:37,677 INFO L225 Difference]: With dead ends: 217 [2021-06-05 21:43:37,677 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 21:43:37,678 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 21:43:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 132. [2021-06-05 21:43:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.030534351145038) internal successors, (397), 131 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 397 transitions. [2021-06-05 21:43:37,679 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 397 transitions. Word has length 16 [2021-06-05 21:43:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:37,680 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 397 transitions. [2021-06-05 21:43:37,680 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 397 transitions. [2021-06-05 21:43:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:37,680 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:37,680 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:37,898 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390,130 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:37,898 INFO L430 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1168657166, now seen corresponding path program 64 times [2021-06-05 21:43:37,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:37,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513898119] [2021-06-05 21:43:37,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:37,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:37,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513898119] [2021-06-05 21:43:37,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513898119] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:37,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:37,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:37,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810739208] [2021-06-05 21:43:37,933 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:37,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:37,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:37,933 INFO L87 Difference]: Start difference. First operand 132 states and 397 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:38,013 INFO L93 Difference]: Finished difference Result 227 states and 624 transitions. [2021-06-05 21:43:38,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:38,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:38,014 INFO L225 Difference]: With dead ends: 227 [2021-06-05 21:43:38,014 INFO L226 Difference]: Without dead ends: 223 [2021-06-05 21:43:38,014 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-06-05 21:43:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 134. [2021-06-05 21:43:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.0150375939849625) internal successors, (401), 133 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 401 transitions. [2021-06-05 21:43:38,016 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 401 transitions. Word has length 16 [2021-06-05 21:43:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:38,016 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 401 transitions. [2021-06-05 21:43:38,016 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 401 transitions. [2021-06-05 21:43:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:38,016 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:38,016 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:38,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2021-06-05 21:43:38,017 INFO L430 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:38,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1095284686, now seen corresponding path program 65 times [2021-06-05 21:43:38,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:38,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947709588] [2021-06-05 21:43:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:38,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:38,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:38,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947709588] [2021-06-05 21:43:38,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947709588] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:38,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:38,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:38,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822056343] [2021-06-05 21:43:38,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:38,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:38,044 INFO L87 Difference]: Start difference. First operand 134 states and 401 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:38,125 INFO L93 Difference]: Finished difference Result 210 states and 598 transitions. [2021-06-05 21:43:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:38,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:38,126 INFO L225 Difference]: With dead ends: 210 [2021-06-05 21:43:38,126 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 21:43:38,126 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 21:43:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2021-06-05 21:43:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.015151515151515) internal successors, (398), 132 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 398 transitions. [2021-06-05 21:43:38,129 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 398 transitions. Word has length 16 [2021-06-05 21:43:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:38,129 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 398 transitions. [2021-06-05 21:43:38,129 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 398 transitions. [2021-06-05 21:43:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:38,129 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:38,130 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:38,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2021-06-05 21:43:38,130 INFO L430 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash 429577900, now seen corresponding path program 66 times [2021-06-05 21:43:38,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:38,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976569196] [2021-06-05 21:43:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:38,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:38,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976569196] [2021-06-05 21:43:38,164 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976569196] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:38,164 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:38,164 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:38,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100965898] [2021-06-05 21:43:38,164 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:38,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:38,165 INFO L87 Difference]: Start difference. First operand 133 states and 398 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:38,237 INFO L93 Difference]: Finished difference Result 227 states and 615 transitions. [2021-06-05 21:43:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:38,238 INFO L225 Difference]: With dead ends: 227 [2021-06-05 21:43:38,238 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 21:43:38,238 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 21:43:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2021-06-05 21:43:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.978102189781022) internal successors, (408), 137 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 408 transitions. [2021-06-05 21:43:38,240 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 408 transitions. Word has length 16 [2021-06-05 21:43:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:38,240 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 408 transitions. [2021-06-05 21:43:38,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 408 transitions. [2021-06-05 21:43:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:38,241 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:38,241 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:38,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2021-06-05 21:43:38,241 INFO L430 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:38,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:38,241 INFO L82 PathProgramCache]: Analyzing trace with hash -667749676, now seen corresponding path program 67 times [2021-06-05 21:43:38,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:38,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073633750] [2021-06-05 21:43:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:38,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:38,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073633750] [2021-06-05 21:43:38,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073633750] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:38,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:38,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:38,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945811510] [2021-06-05 21:43:38,271 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:38,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:38,271 INFO L87 Difference]: Start difference. First operand 138 states and 408 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:38,340 INFO L93 Difference]: Finished difference Result 214 states and 596 transitions. [2021-06-05 21:43:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:38,341 INFO L225 Difference]: With dead ends: 214 [2021-06-05 21:43:38,341 INFO L226 Difference]: Without dead ends: 211 [2021-06-05 21:43:38,341 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-06-05 21:43:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 133. [2021-06-05 21:43:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.007575757575758) internal successors, (397), 132 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 397 transitions. [2021-06-05 21:43:38,343 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 397 transitions. Word has length 16 [2021-06-05 21:43:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:38,343 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 397 transitions. [2021-06-05 21:43:38,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 397 transitions. [2021-06-05 21:43:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:38,343 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:38,343 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:38,344 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2021-06-05 21:43:38,344 INFO L430 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash 271584158, now seen corresponding path program 66 times [2021-06-05 21:43:38,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:38,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15347498] [2021-06-05 21:43:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:38,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:38,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15347498] [2021-06-05 21:43:38,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15347498] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:38,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248195741] [2021-06-05 21:43:38,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:38,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:43:38,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:38,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:38,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:38,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248195741] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:38,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:38,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:38,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389668722] [2021-06-05 21:43:38,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:38,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:38,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:38,448 INFO L87 Difference]: Start difference. First operand 133 states and 397 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:38,528 INFO L93 Difference]: Finished difference Result 240 states and 672 transitions. [2021-06-05 21:43:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:38,529 INFO L225 Difference]: With dead ends: 240 [2021-06-05 21:43:38,529 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 21:43:38,529 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 66.9ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 21:43:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2021-06-05 21:43:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 3.0223880597014925) internal successors, (405), 134 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 405 transitions. [2021-06-05 21:43:38,531 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 405 transitions. Word has length 16 [2021-06-05 21:43:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:38,531 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 405 transitions. [2021-06-05 21:43:38,531 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 405 transitions. [2021-06-05 21:43:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:38,531 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:38,532 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:38,732 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397,131 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:38,732 INFO L430 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:38,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1633140264, now seen corresponding path program 67 times [2021-06-05 21:43:38,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:38,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641620464] [2021-06-05 21:43:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:38,765 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:38,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641620464] [2021-06-05 21:43:38,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641620464] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:38,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:38,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:38,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462023500] [2021-06-05 21:43:38,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:38,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:38,766 INFO L87 Difference]: Start difference. First operand 135 states and 405 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:38,851 INFO L93 Difference]: Finished difference Result 217 states and 619 transitions. [2021-06-05 21:43:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:38,852 INFO L225 Difference]: With dead ends: 217 [2021-06-05 21:43:38,852 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 21:43:38,852 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 21:43:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 132. [2021-06-05 21:43:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.0076335877862594) internal successors, (394), 131 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 394 transitions. [2021-06-05 21:43:38,854 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 394 transitions. Word has length 16 [2021-06-05 21:43:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:38,854 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 394 transitions. [2021-06-05 21:43:38,854 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 394 transitions. [2021-06-05 21:43:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:38,854 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:38,854 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:38,855 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2021-06-05 21:43:38,855 INFO L430 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1191160378, now seen corresponding path program 68 times [2021-06-05 21:43:38,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:38,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163637166] [2021-06-05 21:43:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:38,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:38,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163637166] [2021-06-05 21:43:38,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163637166] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:38,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:38,881 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:38,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312725039] [2021-06-05 21:43:38,881 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:38,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:38,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:38,881 INFO L87 Difference]: Start difference. First operand 132 states and 394 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:38,958 INFO L93 Difference]: Finished difference Result 218 states and 587 transitions. [2021-06-05 21:43:38,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:38,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:38,958 INFO L225 Difference]: With dead ends: 218 [2021-06-05 21:43:38,959 INFO L226 Difference]: Without dead ends: 212 [2021-06-05 21:43:38,959 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-06-05 21:43:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 133. [2021-06-05 21:43:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.992424242424242) internal successors, (395), 132 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 395 transitions. [2021-06-05 21:43:38,961 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 395 transitions. Word has length 16 [2021-06-05 21:43:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:38,961 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 395 transitions. [2021-06-05 21:43:38,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 395 transitions. [2021-06-05 21:43:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:38,962 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:38,962 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:38,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2021-06-05 21:43:38,962 INFO L430 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:38,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1677206220, now seen corresponding path program 69 times [2021-06-05 21:43:38,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:38,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875693597] [2021-06-05 21:43:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:38,992 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:38,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875693597] [2021-06-05 21:43:38,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875693597] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:38,993 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:38,993 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:38,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592286972] [2021-06-05 21:43:38,993 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:38,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:38,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:38,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:38,993 INFO L87 Difference]: Start difference. First operand 133 states and 395 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:39,073 INFO L93 Difference]: Finished difference Result 215 states and 577 transitions. [2021-06-05 21:43:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:39,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:39,073 INFO L225 Difference]: With dead ends: 215 [2021-06-05 21:43:39,074 INFO L226 Difference]: Without dead ends: 212 [2021-06-05 21:43:39,074 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-06-05 21:43:39,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 138. [2021-06-05 21:43:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.9562043795620436) internal successors, (405), 137 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 405 transitions. [2021-06-05 21:43:39,075 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 405 transitions. Word has length 16 [2021-06-05 21:43:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:39,076 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 405 transitions. [2021-06-05 21:43:39,076 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 405 transitions. [2021-06-05 21:43:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:39,076 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:39,076 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:39,076 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2021-06-05 21:43:39,076 INFO L430 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1520433500, now seen corresponding path program 70 times [2021-06-05 21:43:39,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:39,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045467380] [2021-06-05 21:43:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:39,104 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:39,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045467380] [2021-06-05 21:43:39,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045467380] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:39,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:39,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:39,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079412914] [2021-06-05 21:43:39,105 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:39,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:39,105 INFO L87 Difference]: Start difference. First operand 138 states and 405 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:39,174 INFO L93 Difference]: Finished difference Result 202 states and 558 transitions. [2021-06-05 21:43:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:39,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:39,175 INFO L225 Difference]: With dead ends: 202 [2021-06-05 21:43:39,175 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 21:43:39,175 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 21:43:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 132. [2021-06-05 21:43:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.0) internal successors, (393), 131 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 393 transitions. [2021-06-05 21:43:39,176 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 393 transitions. Word has length 16 [2021-06-05 21:43:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:39,176 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 393 transitions. [2021-06-05 21:43:39,177 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 393 transitions. [2021-06-05 21:43:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:39,177 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:39,177 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:39,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2021-06-05 21:43:39,177 INFO L430 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:39,177 INFO L82 PathProgramCache]: Analyzing trace with hash -567271218, now seen corresponding path program 68 times [2021-06-05 21:43:39,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:39,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677343291] [2021-06-05 21:43:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:39,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:39,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677343291] [2021-06-05 21:43:39,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677343291] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:39,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696095816] [2021-06-05 21:43:39,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:39,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:39,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:39,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:39,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:39,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696095816] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:39,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:39,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:43:39,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106415178] [2021-06-05 21:43:39,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:43:39,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:39,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:43:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:43:39,270 INFO L87 Difference]: Start difference. First operand 132 states and 393 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:39,357 INFO L93 Difference]: Finished difference Result 274 states and 793 transitions. [2021-06-05 21:43:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:39,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:39,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:39,357 INFO L225 Difference]: With dead ends: 274 [2021-06-05 21:43:39,357 INFO L226 Difference]: Without dead ends: 274 [2021-06-05 21:43:39,358 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-06-05 21:43:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 134. [2021-06-05 21:43:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.0) internal successors, (399), 133 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 399 transitions. [2021-06-05 21:43:39,360 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 399 transitions. Word has length 16 [2021-06-05 21:43:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:39,360 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 399 transitions. [2021-06-05 21:43:39,360 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 399 transitions. [2021-06-05 21:43:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:39,360 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:39,360 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:39,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 132 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable402 [2021-06-05 21:43:39,561 INFO L430 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:39,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash 859329480, now seen corresponding path program 69 times [2021-06-05 21:43:39,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:39,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794682256] [2021-06-05 21:43:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:39,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:39,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794682256] [2021-06-05 21:43:39,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794682256] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:39,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748950235] [2021-06-05 21:43:39,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:39,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:43:39,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:39,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:39,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:39,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748950235] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:39,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:39,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:39,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394029538] [2021-06-05 21:43:39,663 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:39,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:39,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:39,663 INFO L87 Difference]: Start difference. First operand 134 states and 399 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:39,770 INFO L93 Difference]: Finished difference Result 253 states and 716 transitions. [2021-06-05 21:43:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:39,771 INFO L225 Difference]: With dead ends: 253 [2021-06-05 21:43:39,771 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 21:43:39,771 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 65.6ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 21:43:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2021-06-05 21:43:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0148148148148146) internal successors, (407), 135 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 407 transitions. [2021-06-05 21:43:39,773 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 407 transitions. Word has length 16 [2021-06-05 21:43:39,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:39,773 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 407 transitions. [2021-06-05 21:43:39,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 407 transitions. [2021-06-05 21:43:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:39,773 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:39,773 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:39,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable403 [2021-06-05 21:43:39,974 INFO L430 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:39,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:39,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2074081710, now seen corresponding path program 70 times [2021-06-05 21:43:39,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:39,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979117462] [2021-06-05 21:43:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:40,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:40,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979117462] [2021-06-05 21:43:40,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979117462] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:40,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:40,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:40,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911227124] [2021-06-05 21:43:40,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:40,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:40,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:40,001 INFO L87 Difference]: Start difference. First operand 136 states and 407 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:40,095 INFO L93 Difference]: Finished difference Result 230 states and 663 transitions. [2021-06-05 21:43:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:40,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:40,096 INFO L225 Difference]: With dead ends: 230 [2021-06-05 21:43:40,096 INFO L226 Difference]: Without dead ends: 228 [2021-06-05 21:43:40,096 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-06-05 21:43:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131. [2021-06-05 21:43:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 3.0) internal successors, (390), 130 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 390 transitions. [2021-06-05 21:43:40,097 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 390 transitions. Word has length 16 [2021-06-05 21:43:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:40,098 INFO L482 AbstractCegarLoop]: Abstraction has 131 states and 390 transitions. [2021-06-05 21:43:40,098 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 390 transitions. [2021-06-05 21:43:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:40,098 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:40,098 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:40,098 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2021-06-05 21:43:40,098 INFO L430 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2096777692, now seen corresponding path program 71 times [2021-06-05 21:43:40,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:40,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085393533] [2021-06-05 21:43:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:40,144 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:40,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085393533] [2021-06-05 21:43:40,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085393533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:40,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248607824] [2021-06-05 21:43:40,145 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:40,170 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:40,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:40,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:40,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:40,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248607824] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:40,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:40,248 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:40,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944400826] [2021-06-05 21:43:40,248 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:40,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:40,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:40,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:40,248 INFO L87 Difference]: Start difference. First operand 131 states and 390 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:40,425 INFO L93 Difference]: Finished difference Result 217 states and 589 transitions. [2021-06-05 21:43:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:40,425 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:40,426 INFO L225 Difference]: With dead ends: 217 [2021-06-05 21:43:40,426 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 21:43:40,426 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 143.0ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:43:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 21:43:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 136. [2021-06-05 21:43:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.074074074074074) internal successors, (415), 135 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 415 transitions. [2021-06-05 21:43:40,428 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 415 transitions. Word has length 16 [2021-06-05 21:43:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:40,428 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 415 transitions. [2021-06-05 21:43:40,428 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 415 transitions. [2021-06-05 21:43:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:40,428 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:40,428 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:40,628 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405,134 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:40,629 INFO L430 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash -901741518, now seen corresponding path program 71 times [2021-06-05 21:43:40,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:40,629 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426403161] [2021-06-05 21:43:40,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:40,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:40,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426403161] [2021-06-05 21:43:40,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426403161] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:40,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667772342] [2021-06-05 21:43:40,660 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:40,686 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:40,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:40,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:40,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:40,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667772342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:40,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:40,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:40,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746636144] [2021-06-05 21:43:40,746 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:40,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:40,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:40,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:40,747 INFO L87 Difference]: Start difference. First operand 136 states and 415 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:40,822 INFO L93 Difference]: Finished difference Result 211 states and 579 transitions. [2021-06-05 21:43:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:40,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:40,823 INFO L225 Difference]: With dead ends: 211 [2021-06-05 21:43:40,823 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 21:43:40,823 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 76.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 21:43:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 141. [2021-06-05 21:43:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 3.1214285714285714) internal successors, (437), 140 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 437 transitions. [2021-06-05 21:43:40,825 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 437 transitions. Word has length 16 [2021-06-05 21:43:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:40,825 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 437 transitions. [2021-06-05 21:43:40,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 437 transitions. [2021-06-05 21:43:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:40,826 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:40,826 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:41,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406,135 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:41,042 INFO L430 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash 527213588, now seen corresponding path program 72 times [2021-06-05 21:43:41,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:41,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864732759] [2021-06-05 21:43:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:41,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:41,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864732759] [2021-06-05 21:43:41,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864732759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:41,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776532042] [2021-06-05 21:43:41,100 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:41,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:41,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:41,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:41,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:41,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776532042] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:41,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:41,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 21:43:41,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113435775] [2021-06-05 21:43:41,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:43:41,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:43:41,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:41,195 INFO L87 Difference]: Start difference. First operand 141 states and 437 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:41,361 INFO L93 Difference]: Finished difference Result 221 states and 603 transitions. [2021-06-05 21:43:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:41,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:41,362 INFO L225 Difference]: With dead ends: 221 [2021-06-05 21:43:41,362 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 21:43:41,362 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 142.0ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:43:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 21:43:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 144. [2021-06-05 21:43:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.076923076923077) internal successors, (440), 143 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 440 transitions. [2021-06-05 21:43:41,364 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 440 transitions. Word has length 16 [2021-06-05 21:43:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:41,364 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 440 transitions. [2021-06-05 21:43:41,364 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 440 transitions. [2021-06-05 21:43:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:41,364 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:41,364 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:41,565 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409,136 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:41,565 INFO L430 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1453237032, now seen corresponding path program 72 times [2021-06-05 21:43:41,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:41,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229695748] [2021-06-05 21:43:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:41,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:41,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229695748] [2021-06-05 21:43:41,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229695748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:41,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387064381] [2021-06-05 21:43:41,598 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:41,624 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:41,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:41,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:41,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:41,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387064381] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:41,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:41,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:41,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423215371] [2021-06-05 21:43:41,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:41,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:41,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:41,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:41,683 INFO L87 Difference]: Start difference. First operand 144 states and 440 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:41,773 INFO L93 Difference]: Finished difference Result 220 states and 605 transitions. [2021-06-05 21:43:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:41,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:41,774 INFO L225 Difference]: With dead ends: 220 [2021-06-05 21:43:41,774 INFO L226 Difference]: Without dead ends: 220 [2021-06-05 21:43:41,774 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-06-05 21:43:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 138. [2021-06-05 21:43:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0364963503649633) internal successors, (416), 137 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 416 transitions. [2021-06-05 21:43:41,776 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 416 transitions. Word has length 16 [2021-06-05 21:43:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:41,776 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 416 transitions. [2021-06-05 21:43:41,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 416 transitions. [2021-06-05 21:43:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:41,776 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:41,777 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:41,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412,137 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:41,977 INFO L430 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1754194180, now seen corresponding path program 73 times [2021-06-05 21:43:41,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:41,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392624380] [2021-06-05 21:43:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:42,011 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:42,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392624380] [2021-06-05 21:43:42,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392624380] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:42,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232936347] [2021-06-05 21:43:42,011 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:42,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:42,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:42,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232936347] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:42,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:42,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:42,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103312893] [2021-06-05 21:43:42,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:42,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:42,109 INFO L87 Difference]: Start difference. First operand 138 states and 416 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:42,200 INFO L93 Difference]: Finished difference Result 250 states and 667 transitions. [2021-06-05 21:43:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:42,200 INFO L225 Difference]: With dead ends: 250 [2021-06-05 21:43:42,200 INFO L226 Difference]: Without dead ends: 250 [2021-06-05 21:43:42,200 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 85.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-06-05 21:43:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 140. [2021-06-05 21:43:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.050359712230216) internal successors, (424), 139 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 424 transitions. [2021-06-05 21:43:42,202 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 424 transitions. Word has length 16 [2021-06-05 21:43:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:42,202 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 424 transitions. [2021-06-05 21:43:42,203 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 424 transitions. [2021-06-05 21:43:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:42,203 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:42,203 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:42,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable413 [2021-06-05 21:43:42,403 INFO L430 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash 217519174, now seen corresponding path program 74 times [2021-06-05 21:43:42,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:42,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271378796] [2021-06-05 21:43:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:42,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:42,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271378796] [2021-06-05 21:43:42,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271378796] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:42,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354484980] [2021-06-05 21:43:42,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:42,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:42,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:42,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:42,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:42,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354484980] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:42,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:42,523 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:42,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135087829] [2021-06-05 21:43:42,523 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:42,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:42,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:42,524 INFO L87 Difference]: Start difference. First operand 140 states and 424 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:42,621 INFO L93 Difference]: Finished difference Result 228 states and 613 transitions. [2021-06-05 21:43:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:42,621 INFO L225 Difference]: With dead ends: 228 [2021-06-05 21:43:42,621 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 21:43:42,621 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 74.7ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 21:43:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2021-06-05 21:43:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0364963503649633) internal successors, (416), 137 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 416 transitions. [2021-06-05 21:43:42,626 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 416 transitions. Word has length 16 [2021-06-05 21:43:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:42,626 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 416 transitions. [2021-06-05 21:43:42,626 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 416 transitions. [2021-06-05 21:43:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:42,626 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:42,626 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:42,845 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable414 [2021-06-05 21:43:42,846 INFO L430 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:42,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1643175192, now seen corresponding path program 73 times [2021-06-05 21:43:42,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:42,846 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759885670] [2021-06-05 21:43:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:42,874 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:42,874 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759885670] [2021-06-05 21:43:42,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759885670] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:42,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:42,874 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:42,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930049600] [2021-06-05 21:43:42,875 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:42,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:42,875 INFO L87 Difference]: Start difference. First operand 138 states and 416 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:42,972 INFO L93 Difference]: Finished difference Result 235 states and 620 transitions. [2021-06-05 21:43:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:42,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:42,973 INFO L225 Difference]: With dead ends: 235 [2021-06-05 21:43:42,973 INFO L226 Difference]: Without dead ends: 231 [2021-06-05 21:43:42,973 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 72.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-06-05 21:43:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 140. [2021-06-05 21:43:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.0215827338129495) internal successors, (420), 139 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 420 transitions. [2021-06-05 21:43:42,975 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 420 transitions. Word has length 16 [2021-06-05 21:43:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:42,975 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 420 transitions. [2021-06-05 21:43:42,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 420 transitions. [2021-06-05 21:43:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:42,975 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:42,975 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:42,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2021-06-05 21:43:42,975 INFO L430 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1716547672, now seen corresponding path program 74 times [2021-06-05 21:43:42,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:42,975 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100703497] [2021-06-05 21:43:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:43,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:43,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100703497] [2021-06-05 21:43:43,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100703497] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:43,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:43,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:43,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481938959] [2021-06-05 21:43:43,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:43,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:43,004 INFO L87 Difference]: Start difference. First operand 140 states and 420 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:43,101 INFO L93 Difference]: Finished difference Result 218 states and 594 transitions. [2021-06-05 21:43:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:43,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:43,102 INFO L225 Difference]: With dead ends: 218 [2021-06-05 21:43:43,102 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 21:43:43,102 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 21:43:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2021-06-05 21:43:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0291970802919708) internal successors, (415), 137 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 415 transitions. [2021-06-05 21:43:43,104 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 415 transitions. Word has length 16 [2021-06-05 21:43:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:43,104 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 415 transitions. [2021-06-05 21:43:43,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 415 transitions. [2021-06-05 21:43:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:43,104 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:43,104 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:43,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2021-06-05 21:43:43,104 INFO L430 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1912712838, now seen corresponding path program 75 times [2021-06-05 21:43:43,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:43,104 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702141398] [2021-06-05 21:43:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:43,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:43,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702141398] [2021-06-05 21:43:43,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702141398] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:43,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:43,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:43,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416595306] [2021-06-05 21:43:43,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:43,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:43,133 INFO L87 Difference]: Start difference. First operand 138 states and 415 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:43,208 INFO L93 Difference]: Finished difference Result 235 states and 613 transitions. [2021-06-05 21:43:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:43,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:43,209 INFO L225 Difference]: With dead ends: 235 [2021-06-05 21:43:43,209 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 21:43:43,209 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 21:43:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 140. [2021-06-05 21:43:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.014388489208633) internal successors, (419), 139 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 419 transitions. [2021-06-05 21:43:43,211 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 419 transitions. Word has length 16 [2021-06-05 21:43:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:43,211 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 419 transitions. [2021-06-05 21:43:43,211 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 419 transitions. [2021-06-05 21:43:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:43,211 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:43,211 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:43,211 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2021-06-05 21:43:43,211 INFO L430 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash 815385262, now seen corresponding path program 76 times [2021-06-05 21:43:43,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:43,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501182206] [2021-06-05 21:43:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:43,240 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:43,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501182206] [2021-06-05 21:43:43,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501182206] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:43,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:43,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:43,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293334195] [2021-06-05 21:43:43,240 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:43,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:43,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:43,241 INFO L87 Difference]: Start difference. First operand 140 states and 419 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:43,316 INFO L93 Difference]: Finished difference Result 221 states and 592 transitions. [2021-06-05 21:43:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:43,317 INFO L225 Difference]: With dead ends: 221 [2021-06-05 21:43:43,317 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 21:43:43,317 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 21:43:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 139. [2021-06-05 21:43:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.0144927536231885) internal successors, (416), 138 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 416 transitions. [2021-06-05 21:43:43,320 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 416 transitions. Word has length 16 [2021-06-05 21:43:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:43,320 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 416 transitions. [2021-06-05 21:43:43,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 416 transitions. [2021-06-05 21:43:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:43,321 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:43,321 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:43,321 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2021-06-05 21:43:43,321 INFO L430 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:43,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1754719096, now seen corresponding path program 75 times [2021-06-05 21:43:43,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:43,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846665582] [2021-06-05 21:43:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:43,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:43,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846665582] [2021-06-05 21:43:43,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846665582] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:43,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578208815] [2021-06-05 21:43:43,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:43,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:43:43,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:43,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:43,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:43,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578208815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:43,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:43,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:43,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702748618] [2021-06-05 21:43:43,471 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:43,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:43,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:43,471 INFO L87 Difference]: Start difference. First operand 139 states and 416 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:43,560 INFO L93 Difference]: Finished difference Result 254 states and 684 transitions. [2021-06-05 21:43:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:43,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:43,561 INFO L225 Difference]: With dead ends: 254 [2021-06-05 21:43:43,561 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 21:43:43,561 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 99.2ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 21:43:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 141. [2021-06-05 21:43:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 3.0285714285714285) internal successors, (424), 140 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 424 transitions. [2021-06-05 21:43:43,563 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 424 transitions. Word has length 16 [2021-06-05 21:43:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:43,563 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 424 transitions. [2021-06-05 21:43:43,563 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 424 transitions. [2021-06-05 21:43:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:43,563 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:43,563 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:43,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable421 [2021-06-05 21:43:43,764 INFO L430 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1178692094, now seen corresponding path program 76 times [2021-06-05 21:43:43,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:43,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6713605] [2021-06-05 21:43:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:43,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:43,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6713605] [2021-06-05 21:43:43,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6713605] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:43,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:43,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:43,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890522604] [2021-06-05 21:43:43,795 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:43,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:43,795 INFO L87 Difference]: Start difference. First operand 141 states and 424 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:43,903 INFO L93 Difference]: Finished difference Result 228 states and 620 transitions. [2021-06-05 21:43:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:43,904 INFO L225 Difference]: With dead ends: 228 [2021-06-05 21:43:43,904 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 21:43:43,904 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 21:43:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 137. [2021-06-05 21:43:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0) internal successors, (408), 136 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 408 transitions. [2021-06-05 21:43:43,906 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 408 transitions. Word has length 16 [2021-06-05 21:43:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:43,906 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 408 transitions. [2021-06-05 21:43:43,906 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 408 transitions. [2021-06-05 21:43:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:43,907 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:43,907 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:43,907 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2021-06-05 21:43:43,907 INFO L430 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash 433988996, now seen corresponding path program 77 times [2021-06-05 21:43:43,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:43,907 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95711582] [2021-06-05 21:43:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:43,943 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:43,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95711582] [2021-06-05 21:43:43,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95711582] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:43,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779844015] [2021-06-05 21:43:43,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:43,972 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:43:43,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:43,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:43,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:44,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779844015] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:44,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:44,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:44,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221811063] [2021-06-05 21:43:44,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:44,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:44,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:44,041 INFO L87 Difference]: Start difference. First operand 137 states and 408 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:44,135 INFO L93 Difference]: Finished difference Result 206 states and 557 transitions. [2021-06-05 21:43:44,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:44,135 INFO L225 Difference]: With dead ends: 206 [2021-06-05 21:43:44,135 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 21:43:44,135 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 94.6ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 21:43:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 136. [2021-06-05 21:43:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9555555555555557) internal successors, (399), 135 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 399 transitions. [2021-06-05 21:43:44,137 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 399 transitions. Word has length 16 [2021-06-05 21:43:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:44,137 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 399 transitions. [2021-06-05 21:43:44,137 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 399 transitions. [2021-06-05 21:43:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:44,138 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:44,138 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:44,338 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423,141 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:44,338 INFO L430 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1889264946, now seen corresponding path program 78 times [2021-06-05 21:43:44,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:44,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176156512] [2021-06-05 21:43:44,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:44,368 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:44,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176156512] [2021-06-05 21:43:44,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176156512] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:44,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373653667] [2021-06-05 21:43:44,368 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:44,393 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:43:44,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:44,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:44,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:44,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373653667] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:44,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:44,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:44,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039530946] [2021-06-05 21:43:44,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:44,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:44,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:44,451 INFO L87 Difference]: Start difference. First operand 136 states and 399 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:44,544 INFO L93 Difference]: Finished difference Result 197 states and 530 transitions. [2021-06-05 21:43:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:44,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:44,545 INFO L225 Difference]: With dead ends: 197 [2021-06-05 21:43:44,545 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 21:43:44,545 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 79.2ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 21:43:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2021-06-05 21:43:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.9689922480620154) internal successors, (383), 129 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 383 transitions. [2021-06-05 21:43:44,547 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 383 transitions. Word has length 16 [2021-06-05 21:43:44,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:44,547 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 383 transitions. [2021-06-05 21:43:44,547 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 383 transitions. [2021-06-05 21:43:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:44,547 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:44,548 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:44,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 142 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable424 [2021-06-05 21:43:44,764 INFO L430 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1506544558, now seen corresponding path program 79 times [2021-06-05 21:43:44,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:44,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584494219] [2021-06-05 21:43:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:44,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:44,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584494219] [2021-06-05 21:43:44,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584494219] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:44,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085583162] [2021-06-05 21:43:44,791 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:44,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:44,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:44,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085583162] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:44,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:44,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:44,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382416020] [2021-06-05 21:43:44,878 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:44,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:44,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:44,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:44,878 INFO L87 Difference]: Start difference. First operand 130 states and 383 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:44,955 INFO L93 Difference]: Finished difference Result 176 states and 481 transitions. [2021-06-05 21:43:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:44,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:44,956 INFO L225 Difference]: With dead ends: 176 [2021-06-05 21:43:44,956 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 21:43:44,956 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 64.0ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 21:43:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2021-06-05 21:43:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.952755905511811) internal successors, (375), 127 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 375 transitions. [2021-06-05 21:43:44,958 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 375 transitions. Word has length 16 [2021-06-05 21:43:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:44,958 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 375 transitions. [2021-06-05 21:43:44,958 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 375 transitions. [2021-06-05 21:43:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:44,958 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:44,958 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:45,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable427 [2021-06-05 21:43:45,159 INFO L430 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1055429870, now seen corresponding path program 77 times [2021-06-05 21:43:45,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:45,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387919357] [2021-06-05 21:43:45,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:45,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:45,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387919357] [2021-06-05 21:43:45,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387919357] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:45,187 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:45,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:45,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419067786] [2021-06-05 21:43:45,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:45,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:45,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:45,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:45,187 INFO L87 Difference]: Start difference. First operand 128 states and 375 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:45,295 INFO L93 Difference]: Finished difference Result 175 states and 467 transitions. [2021-06-05 21:43:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:45,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:45,296 INFO L225 Difference]: With dead ends: 175 [2021-06-05 21:43:45,296 INFO L226 Difference]: Without dead ends: 171 [2021-06-05 21:43:45,296 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-06-05 21:43:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2021-06-05 21:43:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.931297709923664) internal successors, (384), 131 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 384 transitions. [2021-06-05 21:43:45,298 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 384 transitions. Word has length 16 [2021-06-05 21:43:45,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:45,298 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 384 transitions. [2021-06-05 21:43:45,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 384 transitions. [2021-06-05 21:43:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:45,298 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:45,298 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:45,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2021-06-05 21:43:45,298 INFO L430 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1128802350, now seen corresponding path program 78 times [2021-06-05 21:43:45,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:45,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601870735] [2021-06-05 21:43:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:45,343 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:45,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601870735] [2021-06-05 21:43:45,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601870735] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:45,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:45,343 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:45,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055570972] [2021-06-05 21:43:45,343 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:45,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:45,344 INFO L87 Difference]: Start difference. First operand 132 states and 384 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:45,448 INFO L93 Difference]: Finished difference Result 173 states and 464 transitions. [2021-06-05 21:43:45,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:45,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:45,449 INFO L225 Difference]: With dead ends: 173 [2021-06-05 21:43:45,449 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 21:43:45,449 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 21:43:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2021-06-05 21:43:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.937984496124031) internal successors, (379), 129 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 379 transitions. [2021-06-05 21:43:45,451 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 379 transitions. Word has length 16 [2021-06-05 21:43:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:45,451 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 379 transitions. [2021-06-05 21:43:45,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 379 transitions. [2021-06-05 21:43:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:45,451 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:45,451 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:45,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2021-06-05 21:43:45,451 INFO L430 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1126176574, now seen corresponding path program 79 times [2021-06-05 21:43:45,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:45,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431640601] [2021-06-05 21:43:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:45,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:45,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431640601] [2021-06-05 21:43:45,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431640601] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:45,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:45,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:45,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447183672] [2021-06-05 21:43:45,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:45,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:45,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:45,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:45,485 INFO L87 Difference]: Start difference. First operand 130 states and 379 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:45,579 INFO L93 Difference]: Finished difference Result 161 states and 446 transitions. [2021-06-05 21:43:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:45,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:45,580 INFO L225 Difference]: With dead ends: 161 [2021-06-05 21:43:45,580 INFO L226 Difference]: Without dead ends: 156 [2021-06-05 21:43:45,580 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-06-05 21:43:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2021-06-05 21:43:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9375) internal successors, (376), 128 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 376 transitions. [2021-06-05 21:43:45,581 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 376 transitions. Word has length 16 [2021-06-05 21:43:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:45,581 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 376 transitions. [2021-06-05 21:43:45,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 376 transitions. [2021-06-05 21:43:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:45,582 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:45,582 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:45,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2021-06-05 21:43:45,582 INFO L430 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash -700417548, now seen corresponding path program 80 times [2021-06-05 21:43:45,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:45,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265518895] [2021-06-05 21:43:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:45,620 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:45,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265518895] [2021-06-05 21:43:45,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265518895] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:45,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:45,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:45,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506967683] [2021-06-05 21:43:45,621 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:45,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:45,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:45,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:45,621 INFO L87 Difference]: Start difference. First operand 129 states and 376 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:45,698 INFO L93 Difference]: Finished difference Result 186 states and 490 transitions. [2021-06-05 21:43:45,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:45,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:45,699 INFO L225 Difference]: With dead ends: 186 [2021-06-05 21:43:45,699 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 21:43:45,699 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.8ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 21:43:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 21:43:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.8962962962962964) internal successors, (391), 135 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 391 transitions. [2021-06-05 21:43:45,701 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 391 transitions. Word has length 16 [2021-06-05 21:43:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:45,702 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 391 transitions. [2021-06-05 21:43:45,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 391 transitions. [2021-06-05 21:43:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:45,702 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:45,702 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:45,702 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2021-06-05 21:43:45,702 INFO L430 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1797745124, now seen corresponding path program 81 times [2021-06-05 21:43:45,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:45,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113573720] [2021-06-05 21:43:45,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:45,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:45,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113573720] [2021-06-05 21:43:45,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113573720] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:45,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:45,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:45,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663130007] [2021-06-05 21:43:45,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:45,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:45,734 INFO L87 Difference]: Start difference. First operand 136 states and 391 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:45,821 INFO L93 Difference]: Finished difference Result 185 states and 488 transitions. [2021-06-05 21:43:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:45,822 INFO L225 Difference]: With dead ends: 185 [2021-06-05 21:43:45,822 INFO L226 Difference]: Without dead ends: 182 [2021-06-05 21:43:45,822 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-06-05 21:43:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 135. [2021-06-05 21:43:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8955223880597014) internal successors, (388), 134 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 388 transitions. [2021-06-05 21:43:45,824 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 388 transitions. Word has length 16 [2021-06-05 21:43:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:45,825 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 388 transitions. [2021-06-05 21:43:45,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 388 transitions. [2021-06-05 21:43:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:45,825 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:45,825 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:45,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2021-06-05 21:43:45,825 INFO L430 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 351051412, now seen corresponding path program 82 times [2021-06-05 21:43:45,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:45,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849941540] [2021-06-05 21:43:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:45,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:45,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849941540] [2021-06-05 21:43:45,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849941540] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:45,854 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:45,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:45,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570424376] [2021-06-05 21:43:45,854 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:45,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:45,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:45,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:45,854 INFO L87 Difference]: Start difference. First operand 135 states and 388 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:45,920 INFO L93 Difference]: Finished difference Result 172 states and 468 transitions. [2021-06-05 21:43:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:45,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:45,921 INFO L225 Difference]: With dead ends: 172 [2021-06-05 21:43:45,921 INFO L226 Difference]: Without dead ends: 167 [2021-06-05 21:43:45,921 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-06-05 21:43:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 129. [2021-06-05 21:43:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9296875) internal successors, (375), 128 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 375 transitions. [2021-06-05 21:43:45,923 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 375 transitions. Word has length 16 [2021-06-05 21:43:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:45,923 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 375 transitions. [2021-06-05 21:43:45,923 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 375 transitions. [2021-06-05 21:43:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:45,923 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:45,924 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:45,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2021-06-05 21:43:45,924 INFO L430 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1836118152, now seen corresponding path program 80 times [2021-06-05 21:43:45,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:45,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872135364] [2021-06-05 21:43:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:45,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:45,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872135364] [2021-06-05 21:43:45,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872135364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:45,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116241616] [2021-06-05 21:43:45,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:46,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:46,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:46,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:46,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:46,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116241616] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:46,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:46,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 21:43:46,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403971309] [2021-06-05 21:43:46,070 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:43:46,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:46,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:43:46,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:46,071 INFO L87 Difference]: Start difference. First operand 129 states and 375 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:46,177 INFO L93 Difference]: Finished difference Result 197 states and 540 transitions. [2021-06-05 21:43:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:46,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:46,178 INFO L225 Difference]: With dead ends: 197 [2021-06-05 21:43:46,178 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 21:43:46,178 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 96.7ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 21:43:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 133. [2021-06-05 21:43:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.962121212121212) internal successors, (391), 132 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 391 transitions. [2021-06-05 21:43:46,180 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 391 transitions. Word has length 16 [2021-06-05 21:43:46,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:46,180 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 391 transitions. [2021-06-05 21:43:46,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 391 transitions. [2021-06-05 21:43:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:46,181 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:46,181 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:46,400 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436,144 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:46,401 INFO L430 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1097293038, now seen corresponding path program 81 times [2021-06-05 21:43:46,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:46,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926289959] [2021-06-05 21:43:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:46,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:46,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926289959] [2021-06-05 21:43:46,432 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926289959] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:46,432 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:46,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:46,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395225540] [2021-06-05 21:43:46,432 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:46,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:46,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:46,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:46,432 INFO L87 Difference]: Start difference. First operand 133 states and 391 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:46,542 INFO L93 Difference]: Finished difference Result 193 states and 523 transitions. [2021-06-05 21:43:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:46,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:46,543 INFO L225 Difference]: With dead ends: 193 [2021-06-05 21:43:46,543 INFO L226 Difference]: Without dead ends: 191 [2021-06-05 21:43:46,543 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-06-05 21:43:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 131. [2021-06-05 21:43:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.9461538461538463) internal successors, (383), 130 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 383 transitions. [2021-06-05 21:43:46,545 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 383 transitions. Word has length 16 [2021-06-05 21:43:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:46,545 INFO L482 AbstractCegarLoop]: Abstraction has 131 states and 383 transitions. [2021-06-05 21:43:46,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 383 transitions. [2021-06-05 21:43:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:46,545 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:46,545 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:46,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2021-06-05 21:43:46,545 INFO L430 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1632522840, now seen corresponding path program 82 times [2021-06-05 21:43:46,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:46,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918688750] [2021-06-05 21:43:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:46,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:46,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918688750] [2021-06-05 21:43:46,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918688750] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:46,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:46,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:46,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795349008] [2021-06-05 21:43:46,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:46,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:46,573 INFO L87 Difference]: Start difference. First operand 131 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:46,669 INFO L93 Difference]: Finished difference Result 170 states and 473 transitions. [2021-06-05 21:43:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:46,670 INFO L225 Difference]: With dead ends: 170 [2021-06-05 21:43:46,670 INFO L226 Difference]: Without dead ends: 166 [2021-06-05 21:43:46,670 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-06-05 21:43:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-06-05 21:43:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.9291338582677167) internal successors, (372), 127 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 372 transitions. [2021-06-05 21:43:46,671 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 372 transitions. Word has length 16 [2021-06-05 21:43:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:46,671 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 372 transitions. [2021-06-05 21:43:46,672 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 372 transitions. [2021-06-05 21:43:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:46,672 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:46,672 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:46,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2021-06-05 21:43:46,672 INFO L430 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1788497036, now seen corresponding path program 83 times [2021-06-05 21:43:46,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:46,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269834907] [2021-06-05 21:43:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:46,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:46,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269834907] [2021-06-05 21:43:46,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269834907] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:46,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:46,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:46,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817018006] [2021-06-05 21:43:46,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:46,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:46,707 INFO L87 Difference]: Start difference. First operand 128 states and 372 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:46,773 INFO L93 Difference]: Finished difference Result 154 states and 417 transitions. [2021-06-05 21:43:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:46,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:46,774 INFO L225 Difference]: With dead ends: 154 [2021-06-05 21:43:46,774 INFO L226 Difference]: Without dead ends: 148 [2021-06-05 21:43:46,774 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-06-05 21:43:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2021-06-05 21:43:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9140625) internal successors, (373), 128 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 373 transitions. [2021-06-05 21:43:46,776 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 373 transitions. Word has length 16 [2021-06-05 21:43:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:46,776 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 373 transitions. [2021-06-05 21:43:46,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 373 transitions. [2021-06-05 21:43:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:46,776 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:46,776 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:46,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2021-06-05 21:43:46,776 INFO L430 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:46,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1079869562, now seen corresponding path program 84 times [2021-06-05 21:43:46,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:46,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029328834] [2021-06-05 21:43:46,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:46,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:46,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029328834] [2021-06-05 21:43:46,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029328834] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:46,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:46,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:46,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993192614] [2021-06-05 21:43:46,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:46,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:46,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:46,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:46,804 INFO L87 Difference]: Start difference. First operand 129 states and 373 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:46,892 INFO L93 Difference]: Finished difference Result 164 states and 429 transitions. [2021-06-05 21:43:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:46,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:46,892 INFO L225 Difference]: With dead ends: 164 [2021-06-05 21:43:46,892 INFO L226 Difference]: Without dead ends: 161 [2021-06-05 21:43:46,892 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-06-05 21:43:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2021-06-05 21:43:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.8796992481203008) internal successors, (383), 133 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 383 transitions. [2021-06-05 21:43:46,894 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 383 transitions. Word has length 16 [2021-06-05 21:43:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:46,894 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 383 transitions. [2021-06-05 21:43:46,894 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 383 transitions. [2021-06-05 21:43:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:46,894 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:46,895 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:46,895 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2021-06-05 21:43:46,895 INFO L430 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:46,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2117770158, now seen corresponding path program 85 times [2021-06-05 21:43:46,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:46,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321631667] [2021-06-05 21:43:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:46,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:46,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321631667] [2021-06-05 21:43:46,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321631667] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:46,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:46,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:46,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439071072] [2021-06-05 21:43:46,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:46,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:46,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:46,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:46,923 INFO L87 Difference]: Start difference. First operand 134 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:47,001 INFO L93 Difference]: Finished difference Result 151 states and 410 transitions. [2021-06-05 21:43:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:47,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:47,001 INFO L225 Difference]: With dead ends: 151 [2021-06-05 21:43:47,001 INFO L226 Difference]: Without dead ends: 147 [2021-06-05 21:43:47,001 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-06-05 21:43:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2021-06-05 21:43:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.921259842519685) internal successors, (371), 127 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 371 transitions. [2021-06-05 21:43:47,003 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 371 transitions. Word has length 16 [2021-06-05 21:43:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:47,003 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 371 transitions. [2021-06-05 21:43:47,003 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 371 transitions. [2021-06-05 21:43:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:47,003 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:47,003 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:47,003 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2021-06-05 21:43:47,004 INFO L430 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:47,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:47,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1586215828, now seen corresponding path program 86 times [2021-06-05 21:43:47,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:47,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155745031] [2021-06-05 21:43:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:47,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:47,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155745031] [2021-06-05 21:43:47,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155745031] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:47,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:47,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:47,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406494969] [2021-06-05 21:43:47,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:47,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:47,032 INFO L87 Difference]: Start difference. First operand 128 states and 371 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:47,108 INFO L93 Difference]: Finished difference Result 147 states and 399 transitions. [2021-06-05 21:43:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:47,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:47,108 INFO L225 Difference]: With dead ends: 147 [2021-06-05 21:43:47,108 INFO L226 Difference]: Without dead ends: 144 [2021-06-05 21:43:47,108 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-06-05 21:43:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2021-06-05 21:43:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8805970149253732) internal successors, (386), 134 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 386 transitions. [2021-06-05 21:43:47,110 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 386 transitions. Word has length 16 [2021-06-05 21:43:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:47,110 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 386 transitions. [2021-06-05 21:43:47,110 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 386 transitions. [2021-06-05 21:43:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:47,110 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:47,110 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:47,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2021-06-05 21:43:47,110 INFO L430 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1611423892, now seen corresponding path program 87 times [2021-06-05 21:43:47,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:47,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854241721] [2021-06-05 21:43:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:47,138 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:47,138 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854241721] [2021-06-05 21:43:47,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854241721] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:47,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:47,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:47,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014040938] [2021-06-05 21:43:47,138 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:47,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:47,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:47,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:47,139 INFO L87 Difference]: Start difference. First operand 135 states and 386 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:47,220 INFO L93 Difference]: Finished difference Result 146 states and 397 transitions. [2021-06-05 21:43:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:47,221 INFO L225 Difference]: With dead ends: 146 [2021-06-05 21:43:47,221 INFO L226 Difference]: Without dead ends: 143 [2021-06-05 21:43:47,221 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-06-05 21:43:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2021-06-05 21:43:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.8796992481203008) internal successors, (383), 133 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 383 transitions. [2021-06-05 21:43:47,223 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 383 transitions. Word has length 16 [2021-06-05 21:43:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:47,223 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 383 transitions. [2021-06-05 21:43:47,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 383 transitions. [2021-06-05 21:43:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:47,224 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:47,224 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:47,224 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2021-06-05 21:43:47,224 INFO L430 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:47,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:47,224 INFO L82 PathProgramCache]: Analyzing trace with hash -534746868, now seen corresponding path program 88 times [2021-06-05 21:43:47,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:47,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665742604] [2021-06-05 21:43:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:47,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:47,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665742604] [2021-06-05 21:43:47,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665742604] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:47,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:47,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:47,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404671456] [2021-06-05 21:43:47,253 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:47,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:47,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:47,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:47,254 INFO L87 Difference]: Start difference. First operand 134 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:47,317 INFO L93 Difference]: Finished difference Result 133 states and 377 transitions. [2021-06-05 21:43:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:47,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:47,317 INFO L225 Difference]: With dead ends: 133 [2021-06-05 21:43:47,318 INFO L226 Difference]: Without dead ends: 127 [2021-06-05 21:43:47,318 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-06-05 21:43:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-06-05 21:43:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.9285714285714284) internal successors, (369), 126 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 369 transitions. [2021-06-05 21:43:47,320 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 369 transitions. Word has length 16 [2021-06-05 21:43:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:47,320 INFO L482 AbstractCegarLoop]: Abstraction has 127 states and 369 transitions. [2021-06-05 21:43:47,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 369 transitions. [2021-06-05 21:43:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:47,320 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:47,320 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:47,320 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2021-06-05 21:43:47,320 INFO L430 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1956099518, now seen corresponding path program 83 times [2021-06-05 21:43:47,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:47,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135144539] [2021-06-05 21:43:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:47,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:47,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135144539] [2021-06-05 21:43:47,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135144539] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:47,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615201893] [2021-06-05 21:43:47,349 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:47,374 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:43:47,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:47,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:47,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:47,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615201893] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:47,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:47,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 21:43:47,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106410322] [2021-06-05 21:43:47,408 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 21:43:47,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:47,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 21:43:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 21:43:47,409 INFO L87 Difference]: Start difference. First operand 127 states and 369 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:47,495 INFO L93 Difference]: Finished difference Result 176 states and 508 transitions. [2021-06-05 21:43:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:47,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:47,496 INFO L225 Difference]: With dead ends: 176 [2021-06-05 21:43:47,496 INFO L226 Difference]: Without dead ends: 176 [2021-06-05 21:43:47,496 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:43:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-06-05 21:43:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 121. [2021-06-05 21:43:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.925) internal successors, (351), 120 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 351 transitions. [2021-06-05 21:43:47,497 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 351 transitions. Word has length 16 [2021-06-05 21:43:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:47,498 INFO L482 AbstractCegarLoop]: Abstraction has 121 states and 351 transitions. [2021-06-05 21:43:47,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 351 transitions. [2021-06-05 21:43:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:47,498 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:47,498 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:47,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable445 [2021-06-05 21:43:47,698 INFO L430 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:47,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:47,699 INFO L82 PathProgramCache]: Analyzing trace with hash -912267080, now seen corresponding path program 84 times [2021-06-05 21:43:47,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:47,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680382734] [2021-06-05 21:43:47,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:47,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:47,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680382734] [2021-06-05 21:43:47,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680382734] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:47,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135958797] [2021-06-05 21:43:47,726 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:47,766 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:43:47,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:47,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:47,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:47,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135958797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:47,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:47,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 21:43:47,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073141851] [2021-06-05 21:43:47,807 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 21:43:47,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:47,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 21:43:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 21:43:47,808 INFO L87 Difference]: Start difference. First operand 121 states and 351 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:47,905 INFO L93 Difference]: Finished difference Result 193 states and 540 transitions. [2021-06-05 21:43:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:47,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:47,905 INFO L225 Difference]: With dead ends: 193 [2021-06-05 21:43:47,905 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 21:43:47,905 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:43:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 21:43:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2021-06-05 21:43:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.942622950819672) internal successors, (359), 122 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 359 transitions. [2021-06-05 21:43:47,907 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 359 transitions. Word has length 16 [2021-06-05 21:43:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:47,907 INFO L482 AbstractCegarLoop]: Abstraction has 123 states and 359 transitions. [2021-06-05 21:43:47,907 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 359 transitions. [2021-06-05 21:43:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:47,908 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:47,908 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:48,108 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446,146 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:48,108 INFO L430 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:48,108 INFO L82 PathProgramCache]: Analyzing trace with hash 449289026, now seen corresponding path program 85 times [2021-06-05 21:43:48,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:48,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146075288] [2021-06-05 21:43:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:48,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:48,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146075288] [2021-06-05 21:43:48,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146075288] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:48,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:48,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:48,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385667013] [2021-06-05 21:43:48,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:48,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:48,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:48,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:48,134 INFO L87 Difference]: Start difference. First operand 123 states and 359 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:48,220 INFO L93 Difference]: Finished difference Result 170 states and 487 transitions. [2021-06-05 21:43:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:48,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:48,221 INFO L225 Difference]: With dead ends: 170 [2021-06-05 21:43:48,221 INFO L226 Difference]: Without dead ends: 168 [2021-06-05 21:43:48,221 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-06-05 21:43:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2021-06-05 21:43:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.9237288135593222) internal successors, (345), 118 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 345 transitions. [2021-06-05 21:43:48,223 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 345 transitions. Word has length 16 [2021-06-05 21:43:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:48,223 INFO L482 AbstractCegarLoop]: Abstraction has 119 states and 345 transitions. [2021-06-05 21:43:48,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 345 transitions. [2021-06-05 21:43:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:48,223 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:48,223 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:48,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2021-06-05 21:43:48,223 INFO L430 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1418613346, now seen corresponding path program 86 times [2021-06-05 21:43:48,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:48,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88384321] [2021-06-05 21:43:48,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:48,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:48,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88384321] [2021-06-05 21:43:48,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88384321] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:48,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918666463] [2021-06-05 21:43:48,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:48,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:48,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:48,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 21:43:48,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:48,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918666463] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:48,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:48,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 21:43:48,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44496485] [2021-06-05 21:43:48,352 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:43:48,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:48,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:43:48,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:43:48,355 INFO L87 Difference]: Start difference. First operand 119 states and 345 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:48,470 INFO L93 Difference]: Finished difference Result 151 states and 417 transitions. [2021-06-05 21:43:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:48,471 INFO L225 Difference]: With dead ends: 151 [2021-06-05 21:43:48,471 INFO L226 Difference]: Without dead ends: 151 [2021-06-05 21:43:48,471 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 94.8ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:43:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-06-05 21:43:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 118. [2021-06-05 21:43:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.871794871794872) internal successors, (336), 117 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 336 transitions. [2021-06-05 21:43:48,473 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 336 transitions. Word has length 16 [2021-06-05 21:43:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:48,473 INFO L482 AbstractCegarLoop]: Abstraction has 118 states and 336 transitions. [2021-06-05 21:43:48,473 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 336 transitions. [2021-06-05 21:43:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:48,474 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:48,474 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:48,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable448 [2021-06-05 21:43:48,696 INFO L430 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash -57057240, now seen corresponding path program 87 times [2021-06-05 21:43:48,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:48,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166589583] [2021-06-05 21:43:48,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:48,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:48,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166589583] [2021-06-05 21:43:48,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166589583] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:48,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:48,724 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:48,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639807030] [2021-06-05 21:43:48,724 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:48,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:48,724 INFO L87 Difference]: Start difference. First operand 118 states and 336 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:48,824 INFO L93 Difference]: Finished difference Result 147 states and 400 transitions. [2021-06-05 21:43:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:48,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:48,825 INFO L225 Difference]: With dead ends: 147 [2021-06-05 21:43:48,825 INFO L226 Difference]: Without dead ends: 145 [2021-06-05 21:43:48,825 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-06-05 21:43:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2021-06-05 21:43:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.8521739130434782) internal successors, (328), 115 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 328 transitions. [2021-06-05 21:43:48,826 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 328 transitions. Word has length 16 [2021-06-05 21:43:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:48,826 INFO L482 AbstractCegarLoop]: Abstraction has 116 states and 328 transitions. [2021-06-05 21:43:48,827 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 328 transitions. [2021-06-05 21:43:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 21:43:48,827 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:48,827 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:48,827 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2021-06-05 21:43:48,827 INFO L430 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash -592287042, now seen corresponding path program 88 times [2021-06-05 21:43:48,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:48,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410282862] [2021-06-05 21:43:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:48,850 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:48,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410282862] [2021-06-05 21:43:48,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410282862] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:43:48,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:43:48,851 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 21:43:48,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932846137] [2021-06-05 21:43:48,851 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 21:43:48,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 21:43:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 21:43:48,851 INFO L87 Difference]: Start difference. First operand 116 states and 328 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:48,943 INFO L93 Difference]: Finished difference Result 124 states and 350 transitions. [2021-06-05 21:43:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 21:43:48,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 21:43:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:48,943 INFO L225 Difference]: With dead ends: 124 [2021-06-05 21:43:48,943 INFO L226 Difference]: Without dead ends: 120 [2021-06-05 21:43:48,943 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 63.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:43:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-06-05 21:43:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2021-06-05 21:43:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.878504672897196) internal successors, (308), 107 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 308 transitions. [2021-06-05 21:43:48,953 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 308 transitions. Word has length 16 [2021-06-05 21:43:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:48,953 INFO L482 AbstractCegarLoop]: Abstraction has 108 states and 308 transitions. [2021-06-05 21:43:48,953 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 308 transitions. [2021-06-05 21:43:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:43:48,953 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:48,953 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:48,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2021-06-05 21:43:48,953 INFO L430 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:48,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1638627788, now seen corresponding path program 1 times [2021-06-05 21:43:48,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:48,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116651012] [2021-06-05 21:43:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:49,264 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:49,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116651012] [2021-06-05 21:43:49,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116651012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:49,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584337814] [2021-06-05 21:43:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:49,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:43:49,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:49,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:43:49,447 INFO L388 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 25 treesize of output 19 [2021-06-05 21:43:49,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:49,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:43:49,454 INFO L388 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 25 treesize of output 19 [2021-06-05 21:43:49,455 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:49,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:43:49,461 INFO L388 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 11 [2021-06-05 21:43:49,462 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:49,466 INFO L388 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 35 treesize of output 27 [2021-06-05 21:43:49,467 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:49,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:43:49,518 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:43:49,518 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:117 [2021-06-05 21:43:49,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:43:49,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:49,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:43:49,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:49,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:43:49,862 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:49,901 INFO L628 ElimStorePlain]: treesize reduction 46, result has 53.5 percent of original size [2021-06-05 21:43:49,901 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:43:49,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:43:49,904 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:49,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:43:49,915 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2021-06-05 21:43:49,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:43:49,916 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:158, output treesize:32 [2021-06-05 21:43:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:49,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584337814] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:49,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:49,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 21:43:49,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218240410] [2021-06-05 21:43:49,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:43:49,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:49,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:43:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:43:49,958 INFO L87 Difference]: Start difference. First operand 108 states and 308 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:50,521 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-06-05 21:43:50,831 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2021-06-05 21:43:50,988 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2021-06-05 21:43:51,291 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2021-06-05 21:43:51,884 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2021-06-05 21:43:52,185 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2021-06-05 21:43:52,447 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 21:43:52,857 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2021-06-05 21:43:53,326 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 96 [2021-06-05 21:43:53,737 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2021-06-05 21:43:53,948 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2021-06-05 21:43:54,359 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2021-06-05 21:43:54,745 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2021-06-05 21:43:55,180 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2021-06-05 21:43:55,566 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2021-06-05 21:43:55,979 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2021-06-05 21:43:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:56,053 INFO L93 Difference]: Finished difference Result 324 states and 849 transitions. [2021-06-05 21:43:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 21:43:56,054 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:43:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:56,054 INFO L225 Difference]: With dead ends: 324 [2021-06-05 21:43:56,054 INFO L226 Difference]: Without dead ends: 281 [2021-06-05 21:43:56,054 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 5966.9ms TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 21:43:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-06-05 21:43:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 167. [2021-06-05 21:43:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.86144578313253) internal successors, (475), 166 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 475 transitions. [2021-06-05 21:43:56,057 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 475 transitions. Word has length 17 [2021-06-05 21:43:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:56,057 INFO L482 AbstractCegarLoop]: Abstraction has 167 states and 475 transitions. [2021-06-05 21:43:56,057 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 475 transitions. [2021-06-05 21:43:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:43:56,057 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:56,057 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:43:56,257 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451,148 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:56,258 INFO L430 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:43:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:43:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash -310438566, now seen corresponding path program 2 times [2021-06-05 21:43:56,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:43:56,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109178604] [2021-06-05 21:43:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:43:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:43:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:56,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:43:56,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109178604] [2021-06-05 21:43:56,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109178604] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:56,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690854060] [2021-06-05 21:43:56,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:43:56,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:43:56,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:43:56,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:43:56,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:43:56,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:43:56,855 INFO L388 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 35 treesize of output 27 [2021-06-05 21:43:56,856 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:56,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:43:56,861 INFO L388 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 11 [2021-06-05 21:43:56,862 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:56,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:43:56,868 INFO L388 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 25 treesize of output 19 [2021-06-05 21:43:56,869 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:56,873 INFO L388 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 25 treesize of output 19 [2021-06-05 21:43:56,874 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:56,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:43:56,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:43:56,939 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:139 [2021-06-05 21:43:57,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:43:57,166 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:57,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:43:57,171 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:57,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:43:57,176 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:57,241 INFO L628 ElimStorePlain]: treesize reduction 46, result has 68.9 percent of original size [2021-06-05 21:43:57,241 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:43:57,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:43:57,245 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:57,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:43:57,249 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:57,288 INFO L628 ElimStorePlain]: treesize reduction 20, result has 77.5 percent of original size [2021-06-05 21:43:57,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 21:43:57,302 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:43:57,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:43:57,307 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:43:57,325 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:43:57,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:43:57,330 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:43:57,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:43:57,347 INFO L518 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2021-06-05 21:43:57,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:43:57,348 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:179, output treesize:32 [2021-06-05 21:43:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:43:57,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690854060] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:43:57,386 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:43:57,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 21:43:57,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732923075] [2021-06-05 21:43:57,386 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:43:57,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:43:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:43:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:43:57,386 INFO L87 Difference]: Start difference. First operand 167 states and 475 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:58,265 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-06-05 21:43:58,528 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2021-06-05 21:43:58,752 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2021-06-05 21:43:59,012 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2021-06-05 21:43:59,426 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-06-05 21:43:59,833 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2021-06-05 21:43:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:43:59,950 INFO L93 Difference]: Finished difference Result 264 states and 736 transitions. [2021-06-05 21:43:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 21:43:59,950 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:43:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:43:59,950 INFO L225 Difference]: With dead ends: 264 [2021-06-05 21:43:59,950 INFO L226 Difference]: Without dead ends: 252 [2021-06-05 21:43:59,951 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2674.1ms TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2021-06-05 21:43:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-06-05 21:43:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 176. [2021-06-05 21:43:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.9257142857142857) internal successors, (512), 175 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 512 transitions. [2021-06-05 21:43:59,953 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 512 transitions. Word has length 17 [2021-06-05 21:43:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:43:59,953 INFO L482 AbstractCegarLoop]: Abstraction has 176 states and 512 transitions. [2021-06-05 21:43:59,953 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:43:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 512 transitions. [2021-06-05 21:43:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:43:59,953 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:43:59,953 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:00,154 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 149 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable463 [2021-06-05 21:44:00,154 INFO L430 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1170799304, now seen corresponding path program 3 times [2021-06-05 21:44:00,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:00,155 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483141877] [2021-06-05 21:44:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:00,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:00,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483141877] [2021-06-05 21:44:00,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483141877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:00,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561445767] [2021-06-05 21:44:00,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:00,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:44:00,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:00,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:00,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:00,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:00,565 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:00,570 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:00,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:00,619 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:00,623 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:00,656 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:00,656 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:152, output treesize:117 [2021-06-05 21:44:00,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,745 INFO L388 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 11 [2021-06-05 21:44:00,746 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,751 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:00,752 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,756 INFO L388 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 38 treesize of output 30 [2021-06-05 21:44:00,757 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,761 INFO L388 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 35 treesize of output 27 [2021-06-05 21:44:00,762 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,766 INFO L388 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 17 treesize of output 13 [2021-06-05 21:44:00,767 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,771 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:00,772 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,776 INFO L388 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 28 treesize of output 22 [2021-06-05 21:44:00,777 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,781 INFO L388 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 27 treesize of output 21 [2021-06-05 21:44:00,781 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,876 INFO L628 ElimStorePlain]: treesize reduction 110, result has 56.7 percent of original size [2021-06-05 21:44:00,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,880 INFO L388 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 22 treesize of output 14 [2021-06-05 21:44:00,880 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,883 INFO L388 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 24 treesize of output 16 [2021-06-05 21:44:00,884 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:00,888 INFO L388 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 [2021-06-05 21:44:00,890 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:00,892 INFO L388 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 21 treesize of output 13 [2021-06-05 21:44:00,909 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:00,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:00,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:44:00,964 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:321, output treesize:99 [2021-06-05 21:44:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:01,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561445767] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:01,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:01,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:01,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617940095] [2021-06-05 21:44:01,099 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:01,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:01,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:01,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:01,100 INFO L87 Difference]: Start difference. First operand 176 states and 512 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:01,788 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2021-06-05 21:44:01,978 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2021-06-05 21:44:02,223 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2021-06-05 21:44:02,428 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2021-06-05 21:44:02,641 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2021-06-05 21:44:02,883 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2021-06-05 21:44:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:03,103 INFO L93 Difference]: Finished difference Result 283 states and 795 transitions. [2021-06-05 21:44:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 21:44:03,103 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:03,103 INFO L225 Difference]: With dead ends: 283 [2021-06-05 21:44:03,103 INFO L226 Difference]: Without dead ends: 252 [2021-06-05 21:44:03,104 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1998.6ms TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2021-06-05 21:44:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-06-05 21:44:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 180. [2021-06-05 21:44:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.916201117318436) internal successors, (522), 179 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2021-06-05 21:44:03,107 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 17 [2021-06-05 21:44:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:03,107 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2021-06-05 21:44:03,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2021-06-05 21:44:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:03,107 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:03,107 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:03,308 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable479 [2021-06-05 21:44:03,309 INFO L430 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 227417012, now seen corresponding path program 4 times [2021-06-05 21:44:03,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:03,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688712614] [2021-06-05 21:44:03,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:03,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:03,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688712614] [2021-06-05 21:44:03,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688712614] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:03,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597355128] [2021-06-05 21:44:03,668 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:03,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:44:03,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:03,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:03,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:03,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:03,902 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:03,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:03,907 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:03,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:03,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:04,015 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 21:44:04,016 INFO L628 ElimStorePlain]: treesize reduction 62, result has 72.1 percent of original size [2021-06-05 21:44:04,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:04,020 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:04,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:04,023 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:04,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:04,026 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:04,096 INFO L628 ElimStorePlain]: treesize reduction 10, result has 92.6 percent of original size [2021-06-05 21:44:04,097 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:44:04,097 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:245, output treesize:125 [2021-06-05 21:44:04,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:44:04,196 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:04,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:04,200 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:04,245 INFO L628 ElimStorePlain]: treesize reduction 30, result has 76.6 percent of original size [2021-06-05 21:44:04,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 21:44:04,249 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:04,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:04,254 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:04,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:04,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:04,277 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:04,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:04,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 21:44:04,300 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:04,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:04,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:04,322 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:04,348 INFO L628 ElimStorePlain]: treesize reduction 16, result has 74.2 percent of original size [2021-06-05 21:44:04,348 INFO L518 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2021-06-05 21:44:04,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:04,348 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:140, output treesize:32 [2021-06-05 21:44:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:04,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597355128] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:04,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:04,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 21:44:04,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733982314] [2021-06-05 21:44:04,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:44:04,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:44:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:44:04,409 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:04,968 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2021-06-05 21:44:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:05,094 INFO L93 Difference]: Finished difference Result 265 states and 737 transitions. [2021-06-05 21:44:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 21:44:05,094 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:05,095 INFO L225 Difference]: With dead ends: 265 [2021-06-05 21:44:05,095 INFO L226 Difference]: Without dead ends: 259 [2021-06-05 21:44:05,095 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 928.1ms TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:44:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-06-05 21:44:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 184. [2021-06-05 21:44:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.907103825136612) internal successors, (532), 183 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 532 transitions. [2021-06-05 21:44:05,097 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 532 transitions. Word has length 17 [2021-06-05 21:44:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:05,097 INFO L482 AbstractCegarLoop]: Abstraction has 184 states and 532 transitions. [2021-06-05 21:44:05,097 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 532 transitions. [2021-06-05 21:44:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:05,098 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:05,098 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:05,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495,151 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:05,309 INFO L430 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1708654882, now seen corresponding path program 5 times [2021-06-05 21:44:05,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:05,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212475985] [2021-06-05 21:44:05,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:05,515 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:05,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212475985] [2021-06-05 21:44:05,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212475985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:05,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958328605] [2021-06-05 21:44:05,515 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:05,542 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:44:05,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:05,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:05,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:05,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:05,731 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:05,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:05,736 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:05,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:05,742 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:05,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:05,747 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:05,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:05,751 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:05,872 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2021-06-05 21:44:05,872 INFO L628 ElimStorePlain]: treesize reduction 60, result has 72.5 percent of original size [2021-06-05 21:44:05,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:05,877 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:05,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:05,883 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:05,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:05,888 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:05,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:05,940 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:44:05,940 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:257, output treesize:128 [2021-06-05 21:44:06,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:06,093 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:06,177 INFO L628 ElimStorePlain]: treesize reduction 80, result has 54.0 percent of original size [2021-06-05 21:44:06,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:06,182 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:06,209 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:06,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:06,214 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:06,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:06,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 21:44:06,240 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:06,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:44:06,243 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:06,269 INFO L628 ElimStorePlain]: treesize reduction 20, result has 70.6 percent of original size [2021-06-05 21:44:06,270 INFO L518 ElimStorePlain]: Eliminatee v_prenex_18 vanished before elimination [2021-06-05 21:44:06,270 INFO L518 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2021-06-05 21:44:06,270 INFO L518 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2021-06-05 21:44:06,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:06,273 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:06,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:44:06,277 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:06,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:06,289 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:06,290 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:193, output treesize:32 [2021-06-05 21:44:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:06,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958328605] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:06,327 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:06,327 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:06,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964145828] [2021-06-05 21:44:06,327 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:06,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:06,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:06,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:06,327 INFO L87 Difference]: Start difference. First operand 184 states and 532 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:06,838 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2021-06-05 21:44:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:07,044 INFO L93 Difference]: Finished difference Result 279 states and 768 transitions. [2021-06-05 21:44:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:44:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:07,045 INFO L225 Difference]: With dead ends: 279 [2021-06-05 21:44:07,045 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 21:44:07,045 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 895.4ms TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:44:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 21:44:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 182. [2021-06-05 21:44:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.911602209944751) internal successors, (527), 181 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 527 transitions. [2021-06-05 21:44:07,047 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 527 transitions. Word has length 17 [2021-06-05 21:44:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:07,047 INFO L482 AbstractCegarLoop]: Abstraction has 182 states and 527 transitions. [2021-06-05 21:44:07,048 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 527 transitions. [2021-06-05 21:44:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:07,048 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:07,048 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:07,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519,152 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:07,248 INFO L430 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1137200076, now seen corresponding path program 6 times [2021-06-05 21:44:07,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:07,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9063822] [2021-06-05 21:44:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:07,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:07,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9063822] [2021-06-05 21:44:07,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9063822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:07,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098807200] [2021-06-05 21:44:07,484 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:07,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:44:07,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:07,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:07,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:07,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:07,611 INFO L388 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 11 [2021-06-05 21:44:07,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:07,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:07,616 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:07,617 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:07,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:07,622 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:07,623 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:07,626 INFO L388 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 35 treesize of output 27 [2021-06-05 21:44:07,628 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:07,671 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:07,672 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:07,673 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:139, output treesize:108 [2021-06-05 21:44:07,873 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_20], 1=[v_prenex_21, array_4]} [2021-06-05 21:44:07,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:07,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:07,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:07,885 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:07,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:07,891 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:07,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 21:44:07,897 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:08,025 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-06-05 21:44:08,026 INFO L628 ElimStorePlain]: treesize reduction 145, result has 51.7 percent of original size [2021-06-05 21:44:08,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:44:08,031 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:08,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:44:08,035 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:08,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:08,080 INFO L388 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 21 treesize of output 13 [2021-06-05 21:44:08,081 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:08,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:08,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:08,127 INFO L388 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 [2021-06-05 21:44:08,129 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:08,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:08,133 INFO L388 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 [2021-06-05 21:44:08,135 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:08,143 INFO L388 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 24 treesize of output 16 [2021-06-05 21:44:08,143 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:08,184 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:08,186 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:44:08,186 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:335, output treesize:102 [2021-06-05 21:44:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:08,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098807200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:08,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:08,348 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:08,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116021165] [2021-06-05 21:44:08,349 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:08,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:08,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:08,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:08,349 INFO L87 Difference]: Start difference. First operand 182 states and 527 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:08,943 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-06-05 21:44:09,193 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2021-06-05 21:44:09,361 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2021-06-05 21:44:09,494 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2021-06-05 21:44:09,691 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2021-06-05 21:44:09,929 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2021-06-05 21:44:10,155 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2021-06-05 21:44:10,419 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2021-06-05 21:44:10,673 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2021-06-05 21:44:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:10,752 INFO L93 Difference]: Finished difference Result 416 states and 1139 transitions. [2021-06-05 21:44:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 21:44:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:10,753 INFO L225 Difference]: With dead ends: 416 [2021-06-05 21:44:10,753 INFO L226 Difference]: Without dead ends: 306 [2021-06-05 21:44:10,754 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2420.6ms TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2021-06-05 21:44:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-06-05 21:44:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 211. [2021-06-05 21:44:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.9714285714285715) internal successors, (624), 210 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 624 transitions. [2021-06-05 21:44:10,756 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 624 transitions. Word has length 17 [2021-06-05 21:44:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:10,756 INFO L482 AbstractCegarLoop]: Abstraction has 211 states and 624 transitions. [2021-06-05 21:44:10,756 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 624 transitions. [2021-06-05 21:44:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:10,757 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:10,757 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:10,957 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549,153 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:10,957 INFO L430 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1264185258, now seen corresponding path program 7 times [2021-06-05 21:44:10,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:10,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742534383] [2021-06-05 21:44:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:11,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:11,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742534383] [2021-06-05 21:44:11,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742534383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:11,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032521447] [2021-06-05 21:44:11,284 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:11,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:11,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:11,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:11,393 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:11,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:11,397 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:11,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:11,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:11,427 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:11,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:11,431 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:11,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:11,453 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:11,453 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:64 [2021-06-05 21:44:11,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:11,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:11,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:11,581 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:11,614 INFO L628 ElimStorePlain]: treesize reduction 39, result has 64.9 percent of original size [2021-06-05 21:44:11,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:11,618 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:11,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:11,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:11,635 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:11,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:11,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:11,650 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:11,661 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:11,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:11,664 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:11,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:11,675 INFO L518 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2021-06-05 21:44:11,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:11,675 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 21:44:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:11,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032521447] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:11,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:11,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:11,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339224272] [2021-06-05 21:44:11,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:11,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:11,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:11,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:11,711 INFO L87 Difference]: Start difference. First operand 211 states and 624 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:12,291 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2021-06-05 21:44:12,481 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2021-06-05 21:44:12,727 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2021-06-05 21:44:12,920 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2021-06-05 21:44:13,129 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2021-06-05 21:44:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:13,217 INFO L93 Difference]: Finished difference Result 341 states and 923 transitions. [2021-06-05 21:44:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:44:13,217 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:13,218 INFO L225 Difference]: With dead ends: 341 [2021-06-05 21:44:13,218 INFO L226 Difference]: Without dead ends: 316 [2021-06-05 21:44:13,218 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1528.2ms TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:44:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-06-05 21:44:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 208. [2021-06-05 21:44:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9855072463768115) internal successors, (618), 207 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 618 transitions. [2021-06-05 21:44:13,221 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 618 transitions. Word has length 17 [2021-06-05 21:44:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:13,221 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 618 transitions. [2021-06-05 21:44:13,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 618 transitions. [2021-06-05 21:44:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:13,221 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:13,221 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:13,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 154 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable564 [2021-06-05 21:44:13,422 INFO L430 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1508275688, now seen corresponding path program 8 times [2021-06-05 21:44:13,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:13,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148047500] [2021-06-05 21:44:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:13,745 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2021-06-05 21:44:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:13,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:13,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148047500] [2021-06-05 21:44:13,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148047500] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:13,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320779451] [2021-06-05 21:44:13,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:13,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:44:13,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:13,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:13,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:13,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:13,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:13,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:13,931 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:13,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:13,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:13,966 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:13,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:13,970 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:13,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:13,997 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:13,997 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:70 [2021-06-05 21:44:14,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:44:14,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:14,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:14,078 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:14,129 INFO L628 ElimStorePlain]: treesize reduction 61, result has 52.7 percent of original size [2021-06-05 21:44:14,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:14,133 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:14,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:14,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:14,157 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:14,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:14,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:14,181 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:14,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:14,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:14,199 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:14,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:14,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 21:44:14,214 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:14,225 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:14,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:14,226 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:142, output treesize:32 [2021-06-05 21:44:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:14,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320779451] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:14,263 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:14,264 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:14,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938668962] [2021-06-05 21:44:14,264 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:14,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:14,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:14,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:14,264 INFO L87 Difference]: Start difference. First operand 208 states and 618 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:14,725 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2021-06-05 21:44:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:14,937 INFO L93 Difference]: Finished difference Result 298 states and 856 transitions. [2021-06-05 21:44:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:44:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:14,938 INFO L225 Difference]: With dead ends: 298 [2021-06-05 21:44:14,938 INFO L226 Difference]: Without dead ends: 276 [2021-06-05 21:44:14,938 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 908.7ms TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:44:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-06-05 21:44:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 220. [2021-06-05 21:44:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.9680365296803655) internal successors, (650), 219 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 650 transitions. [2021-06-05 21:44:14,941 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 650 transitions. Word has length 17 [2021-06-05 21:44:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:14,941 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 650 transitions. [2021-06-05 21:44:14,941 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 650 transitions. [2021-06-05 21:44:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:14,941 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:14,941 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:15,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 155 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable573 [2021-06-05 21:44:15,142 INFO L430 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash -27037818, now seen corresponding path program 9 times [2021-06-05 21:44:15,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:15,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596237635] [2021-06-05 21:44:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:15,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:15,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596237635] [2021-06-05 21:44:15,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596237635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:15,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024038634] [2021-06-05 21:44:15,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:15,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:44:15,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:15,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:15,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:15,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:15,659 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:15,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:15,662 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:15,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:15,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:15,691 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:15,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:15,694 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:15,713 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:15,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:15,714 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:73 [2021-06-05 21:44:15,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:44:15,781 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:15,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 21:44:15,786 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:15,820 INFO L628 ElimStorePlain]: treesize reduction 38, result has 65.1 percent of original size [2021-06-05 21:44:15,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:44:15,824 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:15,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:15,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:15,843 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:15,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:15,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_35 vanished before elimination [2021-06-05 21:44:15,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:15,859 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:15,870 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:15,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:15,875 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:15,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:15,887 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:15,888 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:123, output treesize:32 [2021-06-05 21:44:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:15,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024038634] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:15,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:15,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:15,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213268847] [2021-06-05 21:44:15,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:15,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:15,926 INFO L87 Difference]: Start difference. First operand 220 states and 650 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:16,489 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2021-06-05 21:44:16,760 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 21:44:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:17,097 INFO L93 Difference]: Finished difference Result 308 states and 858 transitions. [2021-06-05 21:44:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:44:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:17,098 INFO L225 Difference]: With dead ends: 308 [2021-06-05 21:44:17,098 INFO L226 Difference]: Without dead ends: 268 [2021-06-05 21:44:17,098 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1271.0ms TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:44:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-06-05 21:44:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 210. [2021-06-05 21:44:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.971291866028708) internal successors, (621), 209 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 621 transitions. [2021-06-05 21:44:17,100 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 621 transitions. Word has length 17 [2021-06-05 21:44:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:17,100 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 621 transitions. [2021-06-05 21:44:17,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 621 transitions. [2021-06-05 21:44:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:17,101 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:17,101 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:17,301 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582,156 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:17,301 INFO L430 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1496339310, now seen corresponding path program 10 times [2021-06-05 21:44:17,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:17,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086040205] [2021-06-05 21:44:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:17,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:17,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086040205] [2021-06-05 21:44:17,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086040205] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:17,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336054560] [2021-06-05 21:44:17,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:17,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:44:17,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:17,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:17,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:17,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:17,793 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:17,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:17,797 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:17,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:17,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:17,823 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:17,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:17,827 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:17,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:17,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:17,845 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:60 [2021-06-05 21:44:17,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:17,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:17,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:17,976 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:18,012 INFO L628 ElimStorePlain]: treesize reduction 60, result has 53.1 percent of original size [2021-06-05 21:44:18,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:18,015 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:18,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:18,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:18,033 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:18,047 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:18,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:18,053 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:18,066 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:18,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:18,072 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:18,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:18,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:44:18,088 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:18,099 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:18,100 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:18,100 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:142, output treesize:32 [2021-06-05 21:44:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:18,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336054560] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:18,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:18,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:18,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664828441] [2021-06-05 21:44:18,138 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:18,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:18,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:18,139 INFO L87 Difference]: Start difference. First operand 210 states and 621 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:19,008 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2021-06-05 21:44:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:19,313 INFO L93 Difference]: Finished difference Result 379 states and 1063 transitions. [2021-06-05 21:44:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 21:44:19,314 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:19,314 INFO L225 Difference]: With dead ends: 379 [2021-06-05 21:44:19,314 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 21:44:19,314 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1225.0ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:44:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 21:44:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 221. [2021-06-05 21:44:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.0136363636363637) internal successors, (663), 220 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 663 transitions. [2021-06-05 21:44:19,317 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 663 transitions. Word has length 17 [2021-06-05 21:44:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:19,317 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 663 transitions. [2021-06-05 21:44:19,317 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 663 transitions. [2021-06-05 21:44:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:19,318 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:19,318 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:19,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591,157 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:19,525 INFO L430 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 849561632, now seen corresponding path program 11 times [2021-06-05 21:44:19,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:19,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122581390] [2021-06-05 21:44:19,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:19,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:19,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122581390] [2021-06-05 21:44:19,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122581390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:19,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733435622] [2021-06-05 21:44:19,813 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:19,841 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:44:19,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:19,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 21:44:19,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:19,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:19,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:19,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:19,970 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:20,001 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:20,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:20,005 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:20,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:20,008 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:20,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:20,028 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:20,028 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 21:44:20,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:44:20,092 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:20,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:20,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:20,139 INFO L628 ElimStorePlain]: treesize reduction 40, result has 64.6 percent of original size [2021-06-05 21:44:20,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:20,144 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:20,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:20,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 21:44:20,168 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:20,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:20,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:20,191 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:20,207 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:20,207 INFO L518 ElimStorePlain]: Eliminatee v_prenex_45 vanished before elimination [2021-06-05 21:44:20,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:20,212 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:20,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:20,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:20,230 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 21:44:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:20,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733435622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:20,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:20,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:20,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045192650] [2021-06-05 21:44:20,279 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:20,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:20,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:20,279 INFO L87 Difference]: Start difference. First operand 221 states and 663 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:21,186 INFO L93 Difference]: Finished difference Result 288 states and 848 transitions. [2021-06-05 21:44:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 21:44:21,186 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:21,187 INFO L225 Difference]: With dead ends: 288 [2021-06-05 21:44:21,187 INFO L226 Difference]: Without dead ends: 269 [2021-06-05 21:44:21,187 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1006.4ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:44:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-06-05 21:44:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 224. [2021-06-05 21:44:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.013452914798206) internal successors, (672), 223 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 672 transitions. [2021-06-05 21:44:21,189 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 672 transitions. Word has length 17 [2021-06-05 21:44:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:21,189 INFO L482 AbstractCegarLoop]: Abstraction has 224 states and 672 transitions. [2021-06-05 21:44:21,190 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 672 transitions. [2021-06-05 21:44:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:21,190 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:21,190 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:21,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 158 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable600 [2021-06-05 21:44:21,393 INFO L430 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1964167794, now seen corresponding path program 12 times [2021-06-05 21:44:21,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:21,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184727548] [2021-06-05 21:44:21,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:21,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:21,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184727548] [2021-06-05 21:44:21,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184727548] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:21,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235476759] [2021-06-05 21:44:21,721 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:21,757 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:44:21,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:21,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:21,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:21,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:21,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:21,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:21,883 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:21,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:21,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:21,916 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:21,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:21,919 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:21,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:21,945 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:21,945 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:75 [2021-06-05 21:44:22,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:44:22,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:22,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 21:44:22,028 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:22,073 INFO L628 ElimStorePlain]: treesize reduction 52, result has 54.4 percent of original size [2021-06-05 21:44:22,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:22,076 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:22,093 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:22,093 INFO L518 ElimStorePlain]: Eliminatee v_prenex_51 vanished before elimination [2021-06-05 21:44:22,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:22,097 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:22,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:22,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:22,120 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:22,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:22,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:22,137 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:22,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:22,152 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:22,152 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:152, output treesize:32 [2021-06-05 21:44:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:22,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235476759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:22,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:22,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 21:44:22,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931424161] [2021-06-05 21:44:22,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:44:22,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:44:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:44:22,198 INFO L87 Difference]: Start difference. First operand 224 states and 672 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:23,202 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2021-06-05 21:44:23,335 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2021-06-05 21:44:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:23,417 INFO L93 Difference]: Finished difference Result 283 states and 830 transitions. [2021-06-05 21:44:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 21:44:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:23,417 INFO L225 Difference]: With dead ends: 283 [2021-06-05 21:44:23,417 INFO L226 Difference]: Without dead ends: 270 [2021-06-05 21:44:23,418 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1363.0ms TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:44:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-06-05 21:44:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 230. [2021-06-05 21:44:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 3.004366812227074) internal successors, (688), 229 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 688 transitions. [2021-06-05 21:44:23,421 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 688 transitions. Word has length 17 [2021-06-05 21:44:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:23,421 INFO L482 AbstractCegarLoop]: Abstraction has 230 states and 688 transitions. [2021-06-05 21:44:23,421 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 688 transitions. [2021-06-05 21:44:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:23,422 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:23,422 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:23,643 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 159 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable609 [2021-06-05 21:44:23,644 INFO L430 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:23,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1308901226, now seen corresponding path program 13 times [2021-06-05 21:44:23,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:23,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729175979] [2021-06-05 21:44:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:24,106 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:24,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729175979] [2021-06-05 21:44:24,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729175979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:24,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781142738] [2021-06-05 21:44:24,106 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:24,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:24,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:24,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:24,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:24,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:24,240 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:24,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:24,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:24,270 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:24,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:24,275 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:24,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:24,296 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:24,296 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:66 [2021-06-05 21:44:24,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:24,424 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:24,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:24,428 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:24,465 INFO L628 ElimStorePlain]: treesize reduction 66, result has 53.5 percent of original size [2021-06-05 21:44:24,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 21:44:24,468 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:24,483 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:24,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:24,486 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:24,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:24,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:24,502 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:24,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:24,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:44:24,518 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:24,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:24,530 INFO L518 ElimStorePlain]: Eliminatee v_prenex_55 vanished before elimination [2021-06-05 21:44:24,531 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:24,531 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 21:44:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:24,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781142738] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:24,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:24,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:24,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389691662] [2021-06-05 21:44:24,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:24,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:24,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:24,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:24,567 INFO L87 Difference]: Start difference. First operand 230 states and 688 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:25,117 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 64 [2021-06-05 21:44:25,378 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-05 21:44:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:25,584 INFO L93 Difference]: Finished difference Result 361 states and 1046 transitions. [2021-06-05 21:44:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:44:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:25,585 INFO L225 Difference]: With dead ends: 361 [2021-06-05 21:44:25,585 INFO L226 Difference]: Without dead ends: 341 [2021-06-05 21:44:25,585 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1242.6ms TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:44:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-06-05 21:44:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 250. [2021-06-05 21:44:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0160642570281126) internal successors, (751), 249 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 751 transitions. [2021-06-05 21:44:25,589 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 751 transitions. Word has length 17 [2021-06-05 21:44:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:25,589 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 751 transitions. [2021-06-05 21:44:25,589 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 751 transitions. [2021-06-05 21:44:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:25,590 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:25,590 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:25,811 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618,160 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:25,812 INFO L430 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2024967756, now seen corresponding path program 14 times [2021-06-05 21:44:25,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:25,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461280096] [2021-06-05 21:44:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:26,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:26,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461280096] [2021-06-05 21:44:26,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461280096] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:26,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765619459] [2021-06-05 21:44:26,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:26,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:44:26,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:26,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:26,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:26,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:26,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:26,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:26,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:26,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:26,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:26,471 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:26,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:26,474 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:26,493 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:26,494 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:26,494 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2021-06-05 21:44:26,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:44:26,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:26,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:44:26,583 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:26,622 INFO L628 ElimStorePlain]: treesize reduction 31, result has 67.4 percent of original size [2021-06-05 21:44:26,623 INFO L518 ElimStorePlain]: Eliminatee v_prenex_60 vanished before elimination [2021-06-05 21:44:26,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:26,626 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:26,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:26,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:26,645 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:26,661 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:26,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:26,664 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:26,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:26,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_59 vanished before elimination [2021-06-05 21:44:26,679 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:26,679 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 21:44:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:26,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765619459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:26,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:26,724 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:26,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739218899] [2021-06-05 21:44:26,724 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:26,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:26,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:26,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:26,725 INFO L87 Difference]: Start difference. First operand 250 states and 751 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:27,668 INFO L93 Difference]: Finished difference Result 321 states and 954 transitions. [2021-06-05 21:44:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 21:44:27,669 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:27,669 INFO L225 Difference]: With dead ends: 321 [2021-06-05 21:44:27,669 INFO L226 Difference]: Without dead ends: 311 [2021-06-05 21:44:27,669 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1180.3ms TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:44:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-06-05 21:44:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2021-06-05 21:44:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.0306513409961684) internal successors, (791), 261 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 791 transitions. [2021-06-05 21:44:27,672 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 791 transitions. Word has length 17 [2021-06-05 21:44:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:27,673 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 791 transitions. [2021-06-05 21:44:27,673 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 791 transitions. [2021-06-05 21:44:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:27,673 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:27,673 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:27,873 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable627 [2021-06-05 21:44:27,874 INFO L430 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:27,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:27,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2098340236, now seen corresponding path program 15 times [2021-06-05 21:44:27,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:27,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730747124] [2021-06-05 21:44:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:28,188 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:28,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730747124] [2021-06-05 21:44:28,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730747124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:28,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554752833] [2021-06-05 21:44:28,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:28,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:44:28,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:28,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:28,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:28,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:28,373 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:28,378 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:28,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:28,429 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:28,433 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:28,465 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:28,465 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:115 [2021-06-05 21:44:28,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,565 INFO L388 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 11 [2021-06-05 21:44:28,566 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,572 INFO L388 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 17 treesize of output 13 [2021-06-05 21:44:28,573 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,578 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:28,579 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,585 INFO L388 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 35 treesize of output 27 [2021-06-05 21:44:28,586 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,590 INFO L388 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 29 treesize of output 23 [2021-06-05 21:44:28,591 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,596 INFO L388 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 39 treesize of output 31 [2021-06-05 21:44:28,597 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,601 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:28,602 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,605 INFO L388 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 27 treesize of output 21 [2021-06-05 21:44:28,606 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,709 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2021-06-05 21:44:28,709 INFO L628 ElimStorePlain]: treesize reduction 119, result has 52.0 percent of original size [2021-06-05 21:44:28,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,712 INFO L388 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 24 treesize of output 16 [2021-06-05 21:44:28,713 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:28,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,716 INFO L388 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 10 treesize of output 6 [2021-06-05 21:44:28,721 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:28,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:28,724 INFO L388 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 [2021-06-05 21:44:28,726 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:28,728 INFO L388 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 [2021-06-05 21:44:28,730 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:28,768 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:28,769 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:44:28,769 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:317, output treesize:96 [2021-06-05 21:44:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:28,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554752833] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:28,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:28,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:28,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854547050] [2021-06-05 21:44:28,920 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:28,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:28,920 INFO L87 Difference]: Start difference. First operand 262 states and 791 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:29,301 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2021-06-05 21:44:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:29,387 INFO L93 Difference]: Finished difference Result 309 states and 924 transitions. [2021-06-05 21:44:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:44:29,388 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:29,388 INFO L225 Difference]: With dead ends: 309 [2021-06-05 21:44:29,388 INFO L226 Difference]: Without dead ends: 298 [2021-06-05 21:44:29,388 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 760.0ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:44:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-06-05 21:44:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 263. [2021-06-05 21:44:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.0381679389312977) internal successors, (796), 262 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 796 transitions. [2021-06-05 21:44:29,391 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 796 transitions. Word has length 17 [2021-06-05 21:44:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:29,391 INFO L482 AbstractCegarLoop]: Abstraction has 263 states and 796 transitions. [2021-06-05 21:44:29,391 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 796 transitions. [2021-06-05 21:44:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:29,392 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:29,392 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:29,592 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636,162 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:29,592 INFO L430 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1062058060, now seen corresponding path program 16 times [2021-06-05 21:44:29,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:29,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545869704] [2021-06-05 21:44:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:30,057 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:30,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545869704] [2021-06-05 21:44:30,057 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545869704] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:30,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836588795] [2021-06-05 21:44:30,057 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:30,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:44:30,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:30,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:30,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:30,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:30,221 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:30,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:30,225 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:30,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:30,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:30,252 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:30,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:30,255 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:30,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:30,275 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:30,275 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 21:44:30,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:30,341 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:30,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:30,346 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:30,392 INFO L628 ElimStorePlain]: treesize reduction 39, result has 65.5 percent of original size [2021-06-05 21:44:30,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:30,395 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:30,408 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:30,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 21:44:30,411 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:30,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:30,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:30,428 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:30,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:30,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:30,443 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:30,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:30,454 INFO L518 ElimStorePlain]: Eliminatee v_prenex_66 vanished before elimination [2021-06-05 21:44:30,455 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:30,455 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 21:44:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:30,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836588795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:30,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:30,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:30,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47341961] [2021-06-05 21:44:30,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:30,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:30,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:30,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:30,497 INFO L87 Difference]: Start difference. First operand 263 states and 796 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:31,031 INFO L93 Difference]: Finished difference Result 315 states and 940 transitions. [2021-06-05 21:44:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:44:31,032 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:31,032 INFO L225 Difference]: With dead ends: 315 [2021-06-05 21:44:31,032 INFO L226 Difference]: Without dead ends: 305 [2021-06-05 21:44:31,032 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 913.7ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:44:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-06-05 21:44:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 265. [2021-06-05 21:44:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.0416666666666665) internal successors, (803), 264 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 803 transitions. [2021-06-05 21:44:31,035 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 803 transitions. Word has length 17 [2021-06-05 21:44:31,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:31,035 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 803 transitions. [2021-06-05 21:44:31,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 803 transitions. [2021-06-05 21:44:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:31,036 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:31,036 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:31,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654,163 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:31,236 INFO L430 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:31,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash 419179810, now seen corresponding path program 17 times [2021-06-05 21:44:31,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:31,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437998303] [2021-06-05 21:44:31,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:31,518 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:31,518 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437998303] [2021-06-05 21:44:31,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437998303] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:31,518 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513422954] [2021-06-05 21:44:31,518 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:31,554 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:44:31,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:31,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 21:44:31,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:31,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:31,652 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:31,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:31,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:31,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:31,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:31,681 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:31,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:31,684 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:31,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:31,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:31,703 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:83 [2021-06-05 21:44:31,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:44:31,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:31,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 21:44:31,761 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:31,792 INFO L628 ElimStorePlain]: treesize reduction 10, result has 87.5 percent of original size [2021-06-05 21:44:31,792 INFO L518 ElimStorePlain]: Eliminatee v_prenex_71 vanished before elimination [2021-06-05 21:44:31,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:31,795 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:31,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:31,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:31,809 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:31,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:31,820 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:44:31,820 INFO L518 ElimStorePlain]: Eliminatee v_prenex_69 vanished before elimination [2021-06-05 21:44:31,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:31,821 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:118, output treesize:32 [2021-06-05 21:44:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:31,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513422954] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:31,857 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:31,857 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 21:44:31,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376330234] [2021-06-05 21:44:31,857 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:44:31,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:31,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:44:31,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:44:31,858 INFO L87 Difference]: Start difference. First operand 265 states and 803 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:32,305 INFO L93 Difference]: Finished difference Result 313 states and 936 transitions. [2021-06-05 21:44:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:44:32,305 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:32,306 INFO L225 Difference]: With dead ends: 313 [2021-06-05 21:44:32,306 INFO L226 Difference]: Without dead ends: 303 [2021-06-05 21:44:32,306 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 589.2ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:44:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-06-05 21:44:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2021-06-05 21:44:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 3.0483271375464684) internal successors, (820), 269 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 820 transitions. [2021-06-05 21:44:32,309 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 820 transitions. Word has length 17 [2021-06-05 21:44:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:32,309 INFO L482 AbstractCegarLoop]: Abstraction has 270 states and 820 transitions. [2021-06-05 21:44:32,309 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 820 transitions. [2021-06-05 21:44:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:32,309 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:32,309 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:32,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable663 [2021-06-05 21:44:32,510 INFO L430 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:32,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:32,510 INFO L82 PathProgramCache]: Analyzing trace with hash 968096220, now seen corresponding path program 18 times [2021-06-05 21:44:32,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:32,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305908421] [2021-06-05 21:44:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:32,797 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-06-05 21:44:32,947 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 21:44:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:33,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:33,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305908421] [2021-06-05 21:44:33,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305908421] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:33,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673357650] [2021-06-05 21:44:33,184 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:33,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:44:33,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:33,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 21:44:33,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:33,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:33,331 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:33,332 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:33,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:33,335 INFO L388 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 35 treesize of output 27 [2021-06-05 21:44:33,336 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:33,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:33,339 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:33,340 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:33,343 INFO L388 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 11 [2021-06-05 21:44:33,344 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:33,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:33,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:33,396 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:185, output treesize:151 [2021-06-05 21:44:33,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:33,598 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:33,653 INFO L628 ElimStorePlain]: treesize reduction 25, result has 79.7 percent of original size [2021-06-05 21:44:33,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:44:33,656 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:33,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:33,659 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:33,688 INFO L628 ElimStorePlain]: treesize reduction 20, result has 75.9 percent of original size [2021-06-05 21:44:33,688 INFO L518 ElimStorePlain]: Eliminatee v_prenex_75 vanished before elimination [2021-06-05 21:44:33,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:33,691 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:33,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:33,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:33,706 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:33,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:33,709 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:33,721 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:33,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:33,724 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:33,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:33,736 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:33,736 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:140, output treesize:32 [2021-06-05 21:44:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:33,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673357650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:33,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:33,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 21:44:33,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596846063] [2021-06-05 21:44:33,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:44:33,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:33,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:44:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:44:33,775 INFO L87 Difference]: Start difference. First operand 270 states and 820 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:34,307 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2021-06-05 21:44:34,544 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2021-06-05 21:44:34,837 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2021-06-05 21:44:35,238 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2021-06-05 21:44:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:35,315 INFO L93 Difference]: Finished difference Result 319 states and 954 transitions. [2021-06-05 21:44:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:44:35,315 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:35,316 INFO L225 Difference]: With dead ends: 319 [2021-06-05 21:44:35,316 INFO L226 Difference]: Without dead ends: 309 [2021-06-05 21:44:35,316 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2031.6ms TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:44:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-06-05 21:44:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 272. [2021-06-05 21:44:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.047970479704797) internal successors, (826), 271 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 21:44:35,319 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 17 [2021-06-05 21:44:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:35,319 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 21:44:35,319 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 21:44:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:35,319 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:35,319 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:35,519 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable672 [2021-06-05 21:44:35,520 INFO L430 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash 153290066, now seen corresponding path program 19 times [2021-06-05 21:44:35,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:35,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395005339] [2021-06-05 21:44:35,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:35,968 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:35,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395005339] [2021-06-05 21:44:35,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395005339] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:35,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763001127] [2021-06-05 21:44:35,968 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:36,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:36,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:36,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:36,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:36,253 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,433 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2021-06-05 21:44:36,433 INFO L628 ElimStorePlain]: treesize reduction 63, result has 78.4 percent of original size [2021-06-05 21:44:36,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:36,438 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,531 INFO L628 ElimStorePlain]: treesize reduction 68, result has 68.8 percent of original size [2021-06-05 21:44:36,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:36,535 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:36,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:36,588 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:36,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:36,628 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:36,666 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:44:36,666 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:312, output treesize:125 [2021-06-05 21:44:36,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:36,767 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:36,773 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,848 INFO L628 ElimStorePlain]: treesize reduction 111, result has 48.8 percent of original size [2021-06-05 21:44:36,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:44:36,852 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:44:36,855 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,884 INFO L628 ElimStorePlain]: treesize reduction 22, result has 71.8 percent of original size [2021-06-05 21:44:36,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 21:44:36,888 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:36,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:36,902 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:44:36,902 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:44:36,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:36,906 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:36,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:36,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:36,921 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:36,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:36,933 INFO L518 ElimStorePlain]: Eliminatee v_prenex_84 vanished before elimination [2021-06-05 21:44:36,934 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:36,934 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:239, output treesize:32 [2021-06-05 21:44:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:36,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763001127] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:36,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:36,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 21:44:36,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958674798] [2021-06-05 21:44:36,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:44:36,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:36,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:44:36,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:44:36,974 INFO L87 Difference]: Start difference. First operand 272 states and 826 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:37,588 INFO L93 Difference]: Finished difference Result 323 states and 962 transitions. [2021-06-05 21:44:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:44:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:37,589 INFO L225 Difference]: With dead ends: 323 [2021-06-05 21:44:37,589 INFO L226 Difference]: Without dead ends: 312 [2021-06-05 21:44:37,589 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 981.6ms TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:44:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-06-05 21:44:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 283. [2021-06-05 21:44:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 3.0709219858156027) internal successors, (866), 282 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 866 transitions. [2021-06-05 21:44:37,592 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 866 transitions. Word has length 17 [2021-06-05 21:44:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:37,592 INFO L482 AbstractCegarLoop]: Abstraction has 283 states and 866 transitions. [2021-06-05 21:44:37,592 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 866 transitions. [2021-06-05 21:44:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:37,592 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:37,592 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:37,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 166 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable686 [2021-06-05 21:44:37,793 INFO L430 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1175189202, now seen corresponding path program 20 times [2021-06-05 21:44:37,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:37,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363636745] [2021-06-05 21:44:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:38,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:38,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363636745] [2021-06-05 21:44:38,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363636745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:38,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144481456] [2021-06-05 21:44:38,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:38,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:44:38,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:38,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:38,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:38,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:38,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:38,274 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:38,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:38,322 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:38,327 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:38,369 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:38,369 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:150, output treesize:115 [2021-06-05 21:44:38,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,455 INFO L388 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 38 treesize of output 30 [2021-06-05 21:44:38,456 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,460 INFO L388 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 35 treesize of output 27 [2021-06-05 21:44:38,461 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,464 INFO L388 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 17 treesize of output 13 [2021-06-05 21:44:38,465 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,469 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:38,470 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,473 INFO L388 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 28 treesize of output 22 [2021-06-05 21:44:38,474 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,477 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:38,478 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,482 INFO L388 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 27 treesize of output 21 [2021-06-05 21:44:38,496 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,500 INFO L388 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 11 [2021-06-05 21:44:38,501 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,617 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2021-06-05 21:44:38,617 INFO L628 ElimStorePlain]: treesize reduction 112, result has 53.7 percent of original size [2021-06-05 21:44:38,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,621 INFO L388 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 [2021-06-05 21:44:38,622 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:38,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,625 INFO L388 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 10 treesize of output 6 [2021-06-05 21:44:38,627 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:38,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:38,630 INFO L388 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 24 treesize of output 16 [2021-06-05 21:44:38,630 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:38,633 INFO L388 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 [2021-06-05 21:44:38,634 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:38,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:38,674 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:44:38,674 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:317, output treesize:97 [2021-06-05 21:44:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:38,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144481456] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:38,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:38,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:38,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642488892] [2021-06-05 21:44:38,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:38,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:38,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:38,797 INFO L87 Difference]: Start difference. First operand 283 states and 866 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:39,239 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2021-06-05 21:44:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:39,334 INFO L93 Difference]: Finished difference Result 328 states and 991 transitions. [2021-06-05 21:44:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:44:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:39,335 INFO L225 Difference]: With dead ends: 328 [2021-06-05 21:44:39,336 INFO L226 Difference]: Without dead ends: 318 [2021-06-05 21:44:39,336 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 780.4ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:44:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-06-05 21:44:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2021-06-05 21:44:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.0704225352112675) internal successors, (872), 284 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 872 transitions. [2021-06-05 21:44:39,340 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 872 transitions. Word has length 17 [2021-06-05 21:44:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:39,340 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 872 transitions. [2021-06-05 21:44:39,340 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 872 transitions. [2021-06-05 21:44:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:39,341 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:39,341 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:39,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable725 [2021-06-05 21:44:39,561 INFO L430 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:39,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1517772714, now seen corresponding path program 21 times [2021-06-05 21:44:39,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:39,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377545752] [2021-06-05 21:44:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:39,857 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:39,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377545752] [2021-06-05 21:44:39,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377545752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:39,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215377122] [2021-06-05 21:44:39,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:39,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 21:44:39,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:39,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:39,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:39,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:39,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:39,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:39,969 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:39,991 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:39,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:39,995 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:39,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:39,998 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:40,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:40,018 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:40,018 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:84 [2021-06-05 21:44:40,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:40,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:40,117 INFO L628 ElimStorePlain]: treesize reduction 31, result has 69.9 percent of original size [2021-06-05 21:44:40,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:44:40,122 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:40,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:40,140 INFO L518 ElimStorePlain]: Eliminatee v_prenex_91 vanished before elimination [2021-06-05 21:44:40,140 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:44:40,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:40,144 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:40,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:40,160 INFO L518 ElimStorePlain]: Eliminatee v_prenex_90 vanished before elimination [2021-06-05 21:44:40,161 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:40,161 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:120, output treesize:32 [2021-06-05 21:44:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:40,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215377122] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:40,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:40,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 21:44:40,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799653764] [2021-06-05 21:44:40,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:44:40,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:40,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:44:40,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:44:40,222 INFO L87 Difference]: Start difference. First operand 285 states and 872 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:40,696 INFO L93 Difference]: Finished difference Result 326 states and 985 transitions. [2021-06-05 21:44:40,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 21:44:40,697 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:40,697 INFO L225 Difference]: With dead ends: 326 [2021-06-05 21:44:40,697 INFO L226 Difference]: Without dead ends: 315 [2021-06-05 21:44:40,697 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 621.1ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:44:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-06-05 21:44:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 285. [2021-06-05 21:44:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.0704225352112675) internal successors, (872), 284 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 872 transitions. [2021-06-05 21:44:40,700 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 872 transitions. Word has length 17 [2021-06-05 21:44:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:40,700 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 872 transitions. [2021-06-05 21:44:40,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 872 transitions. [2021-06-05 21:44:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:40,701 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:40,701 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:40,901 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 168 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable741 [2021-06-05 21:44:40,901 INFO L430 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:40,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1096748704, now seen corresponding path program 22 times [2021-06-05 21:44:40,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:40,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372591677] [2021-06-05 21:44:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:41,172 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:41,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372591677] [2021-06-05 21:44:41,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372591677] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:41,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320982332] [2021-06-05 21:44:41,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:41,199 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:44:41,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:41,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:41,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:41,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:41,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:41,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:41,301 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:41,325 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:41,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:41,329 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:41,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:41,332 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:41,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:41,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:41,358 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2021-06-05 21:44:41,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:41,427 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:41,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:41,430 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:41,464 INFO L628 ElimStorePlain]: treesize reduction 45, result has 63.1 percent of original size [2021-06-05 21:44:41,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:44:41,467 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:41,480 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:41,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:41,483 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:41,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:41,496 INFO L518 ElimStorePlain]: Eliminatee v_prenex_96 vanished before elimination [2021-06-05 21:44:41,497 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:44:41,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:44:41,500 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:41,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:41,512 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:41,512 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 21:44:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:41,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320982332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:41,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:41,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:41,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004755709] [2021-06-05 21:44:41,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:41,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:41,547 INFO L87 Difference]: Start difference. First operand 285 states and 872 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:42,501 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2021-06-05 21:44:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:42,716 INFO L93 Difference]: Finished difference Result 361 states and 1073 transitions. [2021-06-05 21:44:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 21:44:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:42,717 INFO L225 Difference]: With dead ends: 361 [2021-06-05 21:44:42,717 INFO L226 Difference]: Without dead ends: 349 [2021-06-05 21:44:42,717 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1196.0ms TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:44:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-06-05 21:44:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 296. [2021-06-05 21:44:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.08135593220339) internal successors, (909), 295 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 909 transitions. [2021-06-05 21:44:42,722 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 909 transitions. Word has length 17 [2021-06-05 21:44:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:42,722 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 909 transitions. [2021-06-05 21:44:42,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 909 transitions. [2021-06-05 21:44:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:42,722 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:42,722 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:42,943 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 169 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable750 [2021-06-05 21:44:42,944 INFO L430 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1716980722, now seen corresponding path program 23 times [2021-06-05 21:44:42,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:42,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515678482] [2021-06-05 21:44:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:43,187 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:43,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515678482] [2021-06-05 21:44:43,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515678482] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:43,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081250815] [2021-06-05 21:44:43,187 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:43,214 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:44:43,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:43,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:43,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:43,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:43,388 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:43,393 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:43,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:43,490 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:43,495 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,594 INFO L628 ElimStorePlain]: treesize reduction 128, result has 54.4 percent of original size [2021-06-05 21:44:43,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:43,598 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:43,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:43,640 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:43,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:43,691 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:43,731 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:44:43,731 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:322, output treesize:124 [2021-06-05 21:44:43,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:43,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,941 INFO L628 ElimStorePlain]: treesize reduction 84, result has 57.8 percent of original size [2021-06-05 21:44:43,942 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:44:43,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 21:44:43,945 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:43,990 INFO L628 ElimStorePlain]: treesize reduction 9, result has 91.7 percent of original size [2021-06-05 21:44:43,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:43,994 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:44,016 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:44,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:44:44,019 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:44,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:44,040 INFO L518 ElimStorePlain]: Eliminatee v_prenex_102 vanished before elimination [2021-06-05 21:44:44,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:44:44,043 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:44,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:44,064 INFO L518 ElimStorePlain]: Eliminatee v_prenex_103 vanished before elimination [2021-06-05 21:44:44,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:44,067 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:44,085 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:44,085 INFO L518 ElimStorePlain]: Eliminatee v_prenex_105 vanished before elimination [2021-06-05 21:44:44,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:44,088 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:44,113 INFO L628 ElimStorePlain]: treesize reduction 14, result has 75.9 percent of original size [2021-06-05 21:44:44,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:44,116 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:44,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:44,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_108 vanished before elimination [2021-06-05 21:44:44,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_109 vanished before elimination [2021-06-05 21:44:44,127 INFO L550 ElimStorePlain]: Start of recursive call 1: 14 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:44,127 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 14 variables, input treesize:206, output treesize:32 [2021-06-05 21:44:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:44,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081250815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:44,164 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:44,164 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:44,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086781034] [2021-06-05 21:44:44,164 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:44,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:44,164 INFO L87 Difference]: Start difference. First operand 296 states and 909 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:44,757 INFO L93 Difference]: Finished difference Result 340 states and 1019 transitions. [2021-06-05 21:44:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:44:44,757 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:44,758 INFO L225 Difference]: With dead ends: 340 [2021-06-05 21:44:44,758 INFO L226 Difference]: Without dead ends: 332 [2021-06-05 21:44:44,758 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 756.9ms TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:44:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-06-05 21:44:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 298. [2021-06-05 21:44:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0774410774410774) internal successors, (914), 297 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 914 transitions. [2021-06-05 21:44:44,761 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 914 transitions. Word has length 17 [2021-06-05 21:44:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:44,761 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 914 transitions. [2021-06-05 21:44:44,761 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 914 transitions. [2021-06-05 21:44:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:44,761 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:44,762 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:44,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759,170 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:44,962 INFO L430 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2006531768, now seen corresponding path program 24 times [2021-06-05 21:44:44,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:44,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980123907] [2021-06-05 21:44:44,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:45,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:45,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980123907] [2021-06-05 21:44:45,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980123907] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:45,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252665741] [2021-06-05 21:44:45,254 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:45,280 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:44:45,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:45,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:45,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:45,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:45,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:45,406 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:45,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:45,444 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:45,447 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:45,450 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:45,455 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,487 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:45,488 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:44:45,488 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:161, output treesize:116 [2021-06-05 21:44:45,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:45,625 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,684 INFO L628 ElimStorePlain]: treesize reduction 67, result has 60.8 percent of original size [2021-06-05 21:44:45,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:45,687 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:45,711 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:44:45,711 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:44:45,711 INFO L518 ElimStorePlain]: Eliminatee v_prenex_120 vanished before elimination [2021-06-05 21:44:45,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:44:45,714 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 21:44:45,717 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:45,742 INFO L628 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size [2021-06-05 21:44:45,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:45,745 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:45,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:45,756 INFO L518 ElimStorePlain]: Eliminatee v_prenex_117 vanished before elimination [2021-06-05 21:44:45,757 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:45,757 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:190, output treesize:32 [2021-06-05 21:44:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:45,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252665741] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:45,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:45,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:45,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933664617] [2021-06-05 21:44:45,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:45,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:45,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:45,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:45,796 INFO L87 Difference]: Start difference. First operand 298 states and 914 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:46,479 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2021-06-05 21:44:46,643 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2021-06-05 21:44:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:46,697 INFO L93 Difference]: Finished difference Result 382 states and 1120 transitions. [2021-06-05 21:44:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:44:46,698 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:46,698 INFO L225 Difference]: With dead ends: 382 [2021-06-05 21:44:46,698 INFO L226 Difference]: Without dead ends: 372 [2021-06-05 21:44:46,698 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1015.1ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:44:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-06-05 21:44:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 298. [2021-06-05 21:44:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0774410774410774) internal successors, (914), 297 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 914 transitions. [2021-06-05 21:44:46,702 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 914 transitions. Word has length 17 [2021-06-05 21:44:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:46,702 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 914 transitions. [2021-06-05 21:44:46,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 914 transitions. [2021-06-05 21:44:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:46,702 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:46,702 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:46,904 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 171 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable789 [2021-06-05 21:44:46,905 INFO L430 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1520655850, now seen corresponding path program 25 times [2021-06-05 21:44:46,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:46,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140131624] [2021-06-05 21:44:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:47,156 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:47,156 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140131624] [2021-06-05 21:44:47,156 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140131624] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:47,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192814713] [2021-06-05 21:44:47,157 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:47,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:47,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:47,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:47,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:47,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:47,280 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:47,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:47,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:47,307 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:47,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:47,310 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:47,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:47,333 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:47,334 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:73 [2021-06-05 21:44:47,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:47,386 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:47,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:47,390 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:47,423 INFO L628 ElimStorePlain]: treesize reduction 38, result has 65.1 percent of original size [2021-06-05 21:44:47,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:47,426 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:47,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:47,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:44:47,444 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:47,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:47,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:44:47,460 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:47,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:47,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:47,476 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:47,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:47,487 INFO L518 ElimStorePlain]: Eliminatee v_prenex_125 vanished before elimination [2021-06-05 21:44:47,487 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:47,487 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:123, output treesize:32 [2021-06-05 21:44:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:47,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192814713] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:47,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:47,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 21:44:47,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470697363] [2021-06-05 21:44:47,524 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:44:47,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:44:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:44:47,524 INFO L87 Difference]: Start difference. First operand 298 states and 914 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:48,238 INFO L93 Difference]: Finished difference Result 372 states and 1109 transitions. [2021-06-05 21:44:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:44:48,239 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:48,239 INFO L225 Difference]: With dead ends: 372 [2021-06-05 21:44:48,239 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 21:44:48,239 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 764.7ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:44:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 21:44:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 297. [2021-06-05 21:44:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 3.0878378378378377) internal successors, (914), 296 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 914 transitions. [2021-06-05 21:44:48,243 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 914 transitions. Word has length 17 [2021-06-05 21:44:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:48,243 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 914 transitions. [2021-06-05 21:44:48,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 914 transitions. [2021-06-05 21:44:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:48,243 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:48,243 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:48,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable808,172 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:48,443 INFO L430 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1001716564, now seen corresponding path program 26 times [2021-06-05 21:44:48,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:48,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401570671] [2021-06-05 21:44:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:48,831 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:48,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401570671] [2021-06-05 21:44:48,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401570671] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:48,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907293602] [2021-06-05 21:44:48,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:48,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:44:48,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:48,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:48,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:48,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:48,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:48,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:48,931 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:48,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:48,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:48,952 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:48,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:48,955 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:48,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:48,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:48,971 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:62 [2021-06-05 21:44:49,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:49,079 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:49,114 INFO L628 ElimStorePlain]: treesize reduction 45, result has 56.7 percent of original size [2021-06-05 21:44:49,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:44:49,116 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:49,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:49,130 INFO L518 ElimStorePlain]: Eliminatee v_prenex_130 vanished before elimination [2021-06-05 21:44:49,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:44:49,133 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:49,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:49,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:49,149 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:49,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:49,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:49,164 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:49,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:49,177 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:49,177 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:123, output treesize:32 [2021-06-05 21:44:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:49,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907293602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:49,216 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:49,216 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:49,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156648149] [2021-06-05 21:44:49,216 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:49,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:49,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:49,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:49,217 INFO L87 Difference]: Start difference. First operand 297 states and 914 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:49,882 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-06-05 21:44:50,084 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 21:44:50,356 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2021-06-05 21:44:50,525 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2021-06-05 21:44:50,747 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2021-06-05 21:44:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:50,856 INFO L93 Difference]: Finished difference Result 447 states and 1309 transitions. [2021-06-05 21:44:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:44:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:50,857 INFO L225 Difference]: With dead ends: 447 [2021-06-05 21:44:50,857 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 21:44:50,857 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1678.5ms TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:44:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 21:44:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 298. [2021-06-05 21:44:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0942760942760943) internal successors, (919), 297 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 919 transitions. [2021-06-05 21:44:50,860 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 919 transitions. Word has length 17 [2021-06-05 21:44:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:50,860 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 919 transitions. [2021-06-05 21:44:50,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 919 transitions. [2021-06-05 21:44:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:50,861 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:50,861 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:51,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817,173 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:51,061 INFO L430 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1965452058, now seen corresponding path program 27 times [2021-06-05 21:44:51,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:51,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883574264] [2021-06-05 21:44:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:51,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:51,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883574264] [2021-06-05 21:44:51,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883574264] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:51,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859792581] [2021-06-05 21:44:51,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:51,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:44:51,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:51,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:51,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:51,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:51,585 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:51,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:51,588 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:51,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:51,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:51,614 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:51,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:51,617 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:51,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:51,637 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:51,637 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 21:44:51,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:51,707 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:51,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:44:51,711 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:51,744 INFO L628 ElimStorePlain]: treesize reduction 40, result has 64.3 percent of original size [2021-06-05 21:44:51,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:51,748 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:51,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:51,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:51,765 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:51,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:51,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 21:44:51,782 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:51,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:51,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:51,797 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:51,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:51,809 INFO L518 ElimStorePlain]: Eliminatee v_prenex_135 vanished before elimination [2021-06-05 21:44:51,809 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:51,809 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 21:44:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:51,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859792581] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:51,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:51,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:51,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867697360] [2021-06-05 21:44:51,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:51,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:51,848 INFO L87 Difference]: Start difference. First operand 298 states and 919 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:52,389 INFO L93 Difference]: Finished difference Result 352 states and 1066 transitions. [2021-06-05 21:44:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:44:52,389 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:52,390 INFO L225 Difference]: With dead ends: 352 [2021-06-05 21:44:52,390 INFO L226 Difference]: Without dead ends: 342 [2021-06-05 21:44:52,390 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 784.8ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:44:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-06-05 21:44:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 300. [2021-06-05 21:44:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.096989966555184) internal successors, (926), 299 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 926 transitions. [2021-06-05 21:44:52,393 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 926 transitions. Word has length 17 [2021-06-05 21:44:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:52,393 INFO L482 AbstractCegarLoop]: Abstraction has 300 states and 926 transitions. [2021-06-05 21:44:52,393 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 926 transitions. [2021-06-05 21:44:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:52,394 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:52,394 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:52,594 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826,174 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:52,594 INFO L430 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash -848277368, now seen corresponding path program 28 times [2021-06-05 21:44:52,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:52,595 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308114731] [2021-06-05 21:44:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:52,846 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:52,846 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308114731] [2021-06-05 21:44:52,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308114731] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:52,846 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96825694] [2021-06-05 21:44:52,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:52,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:44:52,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:52,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:52,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:53,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:53,027 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:53,032 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:53,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:53,076 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:53,080 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:53,112 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:53,112 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:152, output treesize:113 [2021-06-05 21:44:53,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,186 INFO L388 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 11 [2021-06-05 21:44:53,187 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,190 INFO L388 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 28 treesize of output 22 [2021-06-05 21:44:53,191 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,195 INFO L388 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 17 treesize of output 13 [2021-06-05 21:44:53,196 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,199 INFO L388 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 38 treesize of output 30 [2021-06-05 21:44:53,200 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,203 INFO L388 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 27 treesize of output 21 [2021-06-05 21:44:53,204 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,209 INFO L388 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 17 treesize of output 13 [2021-06-05 21:44:53,210 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,214 INFO L388 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 27 treesize of output 21 [2021-06-05 21:44:53,215 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,218 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:53,218 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,314 INFO L628 ElimStorePlain]: treesize reduction 104, result has 57.2 percent of original size [2021-06-05 21:44:53,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,317 INFO L388 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 22 treesize of output 14 [2021-06-05 21:44:53,318 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,321 INFO L388 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 [2021-06-05 21:44:53,323 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:53,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:53,326 INFO L388 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 10 treesize of output 6 [2021-06-05 21:44:53,327 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:53,330 INFO L388 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 25 treesize of output 17 [2021-06-05 21:44:53,331 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:53,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:53,369 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:44:53,369 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:313, output treesize:97 [2021-06-05 21:44:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:53,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96825694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:53,497 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:53,497 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:53,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919707011] [2021-06-05 21:44:53,497 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:53,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:53,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:53,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:53,497 INFO L87 Difference]: Start difference. First operand 300 states and 926 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:53,965 INFO L93 Difference]: Finished difference Result 350 states and 1062 transitions. [2021-06-05 21:44:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:44:53,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:53,966 INFO L225 Difference]: With dead ends: 350 [2021-06-05 21:44:53,966 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 21:44:53,967 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 675.7ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:44:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 21:44:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 299. [2021-06-05 21:44:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 3.0939597315436242) internal successors, (922), 298 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 922 transitions. [2021-06-05 21:44:53,970 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 922 transitions. Word has length 17 [2021-06-05 21:44:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:53,970 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 922 transitions. [2021-06-05 21:44:53,970 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 922 transitions. [2021-06-05 21:44:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:53,970 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:53,970 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:54,170 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable835,175 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:54,171 INFO L430 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash -299360958, now seen corresponding path program 29 times [2021-06-05 21:44:54,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:54,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207577665] [2021-06-05 21:44:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:54,525 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 21:44:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:54,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:54,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207577665] [2021-06-05 21:44:54,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207577665] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:54,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284405389] [2021-06-05 21:44:54,732 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:54,759 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:44:54,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:54,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:54,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:54,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:54,848 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:54,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:54,851 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:54,874 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:54,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:54,877 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:54,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:54,880 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:54,900 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:54,901 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:54,901 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2021-06-05 21:44:54,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:44:54,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:54,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:44:54,968 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:55,002 INFO L628 ElimStorePlain]: treesize reduction 33, result has 66.0 percent of original size [2021-06-05 21:44:55,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:55,006 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:55,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:55,019 INFO L518 ElimStorePlain]: Eliminatee v_prenex_141 vanished before elimination [2021-06-05 21:44:55,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:44:55,023 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:55,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:55,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:55,039 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:55,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:55,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_139 vanished before elimination [2021-06-05 21:44:55,051 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:55,051 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 21:44:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:55,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284405389] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:55,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:55,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:44:55,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115374257] [2021-06-05 21:44:55,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:55,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:55,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:55,087 INFO L87 Difference]: Start difference. First operand 299 states and 922 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:55,497 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2021-06-05 21:44:55,647 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2021-06-05 21:44:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:55,741 INFO L93 Difference]: Finished difference Result 349 states and 1060 transitions. [2021-06-05 21:44:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:44:55,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:55,742 INFO L225 Difference]: With dead ends: 349 [2021-06-05 21:44:55,742 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 21:44:55,742 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1029.0ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:44:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 21:44:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 301. [2021-06-05 21:44:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 21:44:55,745 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 21:44:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:55,745 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 21:44:55,745 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 21:44:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:55,746 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:55,746 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:55,950 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 176 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable851 [2021-06-05 21:44:55,951 INFO L430 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1114167112, now seen corresponding path program 30 times [2021-06-05 21:44:55,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:55,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073174469] [2021-06-05 21:44:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:56,318 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:56,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073174469] [2021-06-05 21:44:56,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073174469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:56,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844030983] [2021-06-05 21:44:56,319 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:56,347 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:44:56,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:56,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:56,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:56,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:56,459 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:56,463 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:56,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:56,503 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:44:56,506 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,538 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:56,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:56,539 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:115 [2021-06-05 21:44:56,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,618 INFO L388 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 27 treesize of output 21 [2021-06-05 21:44:56,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,623 INFO L388 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 11 [2021-06-05 21:44:56,624 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,627 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:56,628 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,632 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:56,633 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,636 INFO L388 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 29 treesize of output 23 [2021-06-05 21:44:56,637 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,641 INFO L388 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 39 treesize of output 31 [2021-06-05 21:44:56,642 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,645 INFO L388 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 17 treesize of output 13 [2021-06-05 21:44:56,646 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,649 INFO L388 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 35 treesize of output 27 [2021-06-05 21:44:56,650 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,747 INFO L628 ElimStorePlain]: treesize reduction 111, result has 55.1 percent of original size [2021-06-05 21:44:56,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,751 INFO L388 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 22 treesize of output 14 [2021-06-05 21:44:56,752 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,755 INFO L388 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 25 treesize of output 17 [2021-06-05 21:44:56,756 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:56,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:56,758 INFO L388 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 [2021-06-05 21:44:56,760 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:56,762 INFO L388 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 10 treesize of output 6 [2021-06-05 21:44:56,764 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:56,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:56,804 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:44:56,804 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:317, output treesize:94 [2021-06-05 21:44:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:56,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844030983] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:56,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:56,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 21:44:56,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358357485] [2021-06-05 21:44:56,953 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:44:56,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:56,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:44:56,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:44:56,953 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:57,477 INFO L93 Difference]: Finished difference Result 363 states and 1106 transitions. [2021-06-05 21:44:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:44:57,478 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:57,479 INFO L225 Difference]: With dead ends: 363 [2021-06-05 21:44:57,479 INFO L226 Difference]: Without dead ends: 352 [2021-06-05 21:44:57,479 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 796.2ms TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:44:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-06-05 21:44:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 301. [2021-06-05 21:44:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.1033333333333335) internal successors, (931), 300 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 931 transitions. [2021-06-05 21:44:57,483 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 931 transitions. Word has length 17 [2021-06-05 21:44:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:57,484 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 931 transitions. [2021-06-05 21:44:57,484 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 931 transitions. [2021-06-05 21:44:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:57,484 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:57,484 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:57,690 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 177 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable860 [2021-06-05 21:44:57,690 INFO L430 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:57,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:57,690 INFO L82 PathProgramCache]: Analyzing trace with hash -92267976, now seen corresponding path program 31 times [2021-06-05 21:44:57,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:57,690 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287606994] [2021-06-05 21:44:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:58,059 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:58,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287606994] [2021-06-05 21:44:58,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287606994] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:58,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684589346] [2021-06-05 21:44:58,060 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:58,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:44:58,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:58,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:58,178 INFO L388 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 11 [2021-06-05 21:44:58,179 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:58,182 INFO L388 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 35 treesize of output 27 [2021-06-05 21:44:58,183 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:44:58,186 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:58,187 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,191 INFO L388 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 25 treesize of output 19 [2021-06-05 21:44:58,192 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,240 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:58,242 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:58,242 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:167, output treesize:132 [2021-06-05 21:44:58,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:58,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:58,434 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:44:58,438 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,495 INFO L628 ElimStorePlain]: treesize reduction 46, result has 69.3 percent of original size [2021-06-05 21:44:58,495 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:44:58,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:44:58,498 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 21:44:58,501 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,529 INFO L628 ElimStorePlain]: treesize reduction 20, result has 74.4 percent of original size [2021-06-05 21:44:58,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:44:58,532 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:58,545 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:58,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:58,548 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:58,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:58,559 INFO L518 ElimStorePlain]: Eliminatee v_prenex_146 vanished before elimination [2021-06-05 21:44:58,560 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:58,560 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:187, output treesize:32 [2021-06-05 21:44:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:58,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684589346] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:58,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:44:58,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:44:58,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389583235] [2021-06-05 21:44:58,598 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:44:58,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:44:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:44:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:44:58,598 INFO L87 Difference]: Start difference. First operand 301 states and 931 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:58,888 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2021-06-05 21:44:59,090 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 56 [2021-06-05 21:44:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:44:59,164 INFO L93 Difference]: Finished difference Result 350 states and 1067 transitions. [2021-06-05 21:44:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:44:59,164 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:44:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:44:59,165 INFO L225 Difference]: With dead ends: 350 [2021-06-05 21:44:59,165 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 21:44:59,165 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 919.3ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:44:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 21:44:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 303. [2021-06-05 21:44:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 21:44:59,169 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 21:44:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:44:59,170 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 21:44:59,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:44:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 21:44:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:44:59,170 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:44:59,170 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:44:59,387 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 178 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable878 [2021-06-05 21:44:59,388 INFO L430 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:44:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:44:59,388 INFO L82 PathProgramCache]: Analyzing trace with hash 250315536, now seen corresponding path program 32 times [2021-06-05 21:44:59,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:44:59,388 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111761752] [2021-06-05 21:44:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:44:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:44:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:44:59,659 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:44:59,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111761752] [2021-06-05 21:44:59,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111761752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:44:59,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734029484] [2021-06-05 21:44:59,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:44:59,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:44:59,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:44:59,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:44:59,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:44:59,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:59,775 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:59,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:59,778 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:59,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:59,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:44:59,804 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:59,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:44:59,807 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:59,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:59,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:59,828 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2021-06-05 21:44:59,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:44:59,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:59,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:44:59,892 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:59,927 INFO L628 ElimStorePlain]: treesize reduction 33, result has 66.0 percent of original size [2021-06-05 21:44:59,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:44:59,930 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:59,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:59,943 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:44:59,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:44:59,946 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:44:59,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:59,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:44:59,962 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:44:59,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:44:59,974 INFO L518 ElimStorePlain]: Eliminatee v_prenex_149 vanished before elimination [2021-06-05 21:44:59,974 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:44:59,974 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 21:45:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:00,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734029484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:00,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:00,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 21:45:00,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226713456] [2021-06-05 21:45:00,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:00,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:00,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:00,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:00,016 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:00,463 INFO L93 Difference]: Finished difference Result 348 states and 1061 transitions. [2021-06-05 21:45:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 21:45:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:00,464 INFO L225 Difference]: With dead ends: 348 [2021-06-05 21:45:00,464 INFO L226 Difference]: Without dead ends: 337 [2021-06-05 21:45:00,464 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 561.6ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:45:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-06-05 21:45:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 301. [2021-06-05 21:45:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.1033333333333335) internal successors, (931), 300 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 931 transitions. [2021-06-05 21:45:00,467 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 931 transitions. Word has length 17 [2021-06-05 21:45:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:00,467 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 931 transitions. [2021-06-05 21:45:00,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 931 transitions. [2021-06-05 21:45:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:00,468 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:00,468 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:00,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 179 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable892 [2021-06-05 21:45:00,668 INFO L430 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash -326980856, now seen corresponding path program 33 times [2021-06-05 21:45:00,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:00,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184360068] [2021-06-05 21:45:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:01,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:01,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184360068] [2021-06-05 21:45:01,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184360068] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:01,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715680972] [2021-06-05 21:45:01,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:01,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:45:01,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:01,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 21:45:01,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:01,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:01,194 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:01,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:01,199 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:01,205 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:01,209 INFO L388 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 11 [2021-06-05 21:45:01,210 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,213 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:01,214 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:01,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:01,261 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:128 [2021-06-05 21:45:01,422 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_152], 1=[array_4, v_prenex_153]} [2021-06-05 21:45:01,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:45:01,426 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:45:01,431 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:01,435 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:45:01,439 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,564 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 21:45:01,564 INFO L628 ElimStorePlain]: treesize reduction 141, result has 55.0 percent of original size [2021-06-05 21:45:01,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:01,568 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:45:01,572 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:01,576 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,624 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:01,627 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:01,628 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:01,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:01,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:01,679 INFO L388 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 [2021-06-05 21:45:01,680 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:01,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:01,684 INFO L388 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 [2021-06-05 21:45:01,685 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:01,688 INFO L388 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 24 treesize of output 16 [2021-06-05 21:45:01,688 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:01,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:01,734 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:45:01,735 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:351, output treesize:113 [2021-06-05 21:45:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:01,875 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715680972] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:01,876 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:01,876 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:45:01,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415559256] [2021-06-05 21:45:01,876 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:01,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:01,876 INFO L87 Difference]: Start difference. First operand 301 states and 931 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:02,209 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2021-06-05 21:45:02,395 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2021-06-05 21:45:02,606 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-05 21:45:02,864 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2021-06-05 21:45:03,117 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2021-06-05 21:45:03,378 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2021-06-05 21:45:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:03,459 INFO L93 Difference]: Finished difference Result 407 states and 1230 transitions. [2021-06-05 21:45:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:45:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:03,460 INFO L225 Difference]: With dead ends: 407 [2021-06-05 21:45:03,460 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 21:45:03,460 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1909.1ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:45:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 21:45:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 303. [2021-06-05 21:45:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 21:45:03,463 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 21:45:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:03,463 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 21:45:03,463 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 21:45:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:03,464 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:03,464 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:03,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901,180 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:03,665 INFO L430 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash 947967822, now seen corresponding path program 34 times [2021-06-05 21:45:03,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:03,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850134412] [2021-06-05 21:45:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:04,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:04,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850134412] [2021-06-05 21:45:04,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850134412] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:04,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094075201] [2021-06-05 21:45:04,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:04,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:45:04,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:04,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:04,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:04,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:04,168 INFO L388 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 11 [2021-06-05 21:45:04,169 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:04,173 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:04,174 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:04,187 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:04,188 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,192 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:04,193 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:04,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:04,247 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:167, output treesize:132 [2021-06-05 21:45:04,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:04,426 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:45:04,430 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,487 INFO L628 ElimStorePlain]: treesize reduction 14, result has 89.7 percent of original size [2021-06-05 21:45:04,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:45:04,492 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:04,519 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:04,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:45:04,523 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 21:45:04,526 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,566 INFO L628 ElimStorePlain]: treesize reduction 11, result has 86.3 percent of original size [2021-06-05 21:45:04,566 INFO L518 ElimStorePlain]: Eliminatee v_prenex_155 vanished before elimination [2021-06-05 21:45:04,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:04,569 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:04,595 INFO L628 ElimStorePlain]: treesize reduction 14, result has 72.0 percent of original size [2021-06-05 21:45:04,595 INFO L518 ElimStorePlain]: Eliminatee v_prenex_157 vanished before elimination [2021-06-05 21:45:04,596 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:04,596 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:150, output treesize:32 [2021-06-05 21:45:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:04,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094075201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:04,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:04,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:45:04,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765817578] [2021-06-05 21:45:04,641 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:04,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:04,641 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:05,073 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2021-06-05 21:45:05,273 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2021-06-05 21:45:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:05,354 INFO L93 Difference]: Finished difference Result 363 states and 1105 transitions. [2021-06-05 21:45:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:45:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:05,359 INFO L225 Difference]: With dead ends: 363 [2021-06-05 21:45:05,359 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 21:45:05,359 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1002.3ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:45:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 21:45:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 305. [2021-06-05 21:45:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.101973684210526) internal successors, (943), 304 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 943 transitions. [2021-06-05 21:45:05,362 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 943 transitions. Word has length 17 [2021-06-05 21:45:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:05,362 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 943 transitions. [2021-06-05 21:45:05,362 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 943 transitions. [2021-06-05 21:45:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:05,363 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:05,363 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:05,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable913,181 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:05,563 INFO L430 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:05,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1290551334, now seen corresponding path program 35 times [2021-06-05 21:45:05,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:05,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326329640] [2021-06-05 21:45:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:05,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:05,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326329640] [2021-06-05 21:45:05,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326329640] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:05,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868339331] [2021-06-05 21:45:05,829 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:05,857 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 21:45:05,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:05,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:05,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:05,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:05,988 INFO L388 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 11 [2021-06-05 21:45:05,989 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:05,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:05,993 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:05,994 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:05,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:05,998 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:05,999 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,003 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:06,004 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:06,058 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:06,058 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:175, output treesize:141 [2021-06-05 21:45:06,165 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_160, array_0, v_prenex_162, v_prenex_158], 1=[v_prenex_161, array_2, v_prenex_163, v_prenex_159]} [2021-06-05 21:45:06,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:06,172 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:45:06,177 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,335 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-06-05 21:45:06,336 INFO L628 ElimStorePlain]: treesize reduction 135, result has 56.7 percent of original size [2021-06-05 21:45:06,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:06,342 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 21:45:06,347 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,404 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:06,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:06,408 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:06,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:06,457 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:06,503 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:06,505 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:06,547 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:06,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:06,550 INFO L388 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 25 treesize of output 17 [2021-06-05 21:45:06,551 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,554 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:06,554 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:06,601 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:06,604 INFO L388 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 [2021-06-05 21:45:06,605 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:06,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:06,646 INFO L518 ElimStorePlain]: Eliminatee v_prenex_159 vanished before elimination [2021-06-05 21:45:06,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:45:06,647 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:329, output treesize:100 [2021-06-05 21:45:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:06,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868339331] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:06,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:06,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 21:45:06,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132509732] [2021-06-05 21:45:06,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:06,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:06,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:06,778 INFO L87 Difference]: Start difference. First operand 305 states and 943 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:07,285 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2021-06-05 21:45:07,425 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-06-05 21:45:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:07,493 INFO L93 Difference]: Finished difference Result 361 states and 1099 transitions. [2021-06-05 21:45:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:45:07,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:07,494 INFO L225 Difference]: With dead ends: 361 [2021-06-05 21:45:07,494 INFO L226 Difference]: Without dead ends: 350 [2021-06-05 21:45:07,494 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 965.6ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:45:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-06-05 21:45:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 303. [2021-06-05 21:45:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 21:45:07,497 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 21:45:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:07,497 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 21:45:07,497 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 21:45:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:07,498 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:07,498 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:07,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable927,182 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:07,698 INFO L430 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:07,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2132806164, now seen corresponding path program 36 times [2021-06-05 21:45:07,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:07,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792572972] [2021-06-05 21:45:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:07,987 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:07,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792572972] [2021-06-05 21:45:07,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792572972] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:07,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056409872] [2021-06-05 21:45:07,987 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:08,014 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:45:08,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:08,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:08,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:08,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,200 INFO L388 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 11 [2021-06-05 21:45:08,201 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:08,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,204 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:08,207 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:08,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:08,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,278 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:08,279 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:08,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,282 INFO L388 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 11 [2021-06-05 21:45:08,283 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:08,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:08,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,346 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:08,347 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:08,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:08,350 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:08,350 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:08,402 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:08,406 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 21:45:08,406 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:241, output treesize:201 [2021-06-05 21:45:08,825 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_171, v_prenex_173, array_2, v_prenex_175, v_prenex_177, v_prenex_179], 1=[v_prenex_180, v_prenex_172, v_prenex_174, array_4, v_prenex_176, v_prenex_178]} [2021-06-05 21:45:08,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:45:08,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:08,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:08,842 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,050 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 92 [2021-06-05 21:45:09,051 INFO L628 ElimStorePlain]: treesize reduction 193, result has 53.9 percent of original size [2021-06-05 21:45:09,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:09,059 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:45:09,142 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:09,149 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:09,210 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:09,268 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:09,321 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:09,372 INFO L388 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 [2021-06-05 21:45:09,374 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:09,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:09,425 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:09,426 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,473 INFO L518 ElimStorePlain]: Eliminatee v_prenex_174 vanished before elimination [2021-06-05 21:45:09,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:09,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:09,478 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:09,478 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:09,482 INFO L388 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 25 treesize of output 17 [2021-06-05 21:45:09,483 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:09,529 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,529 INFO L518 ElimStorePlain]: Eliminatee v_prenex_176 vanished before elimination [2021-06-05 21:45:09,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:09,533 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:09,534 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:09,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:09,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:45:09,583 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:435, output treesize:67 [2021-06-05 21:45:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:09,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056409872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:09,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:09,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:45:09,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783863099] [2021-06-05 21:45:09,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:09,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:09,646 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:10,550 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 125 [2021-06-05 21:45:10,792 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2021-06-05 21:45:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:10,832 INFO L93 Difference]: Finished difference Result 384 states and 1130 transitions. [2021-06-05 21:45:10,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:45:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:10,833 INFO L225 Difference]: With dead ends: 384 [2021-06-05 21:45:10,833 INFO L226 Difference]: Without dead ends: 370 [2021-06-05 21:45:10,833 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1493.2ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:45:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-05 21:45:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 306. [2021-06-05 21:45:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.095081967213115) internal successors, (944), 305 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 944 transitions. [2021-06-05 21:45:10,836 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 944 transitions. Word has length 17 [2021-06-05 21:45:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:10,837 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 944 transitions. [2021-06-05 21:45:10,837 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 944 transitions. [2021-06-05 21:45:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:10,837 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:10,837 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:11,037 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 183 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable940 [2021-06-05 21:45:11,038 INFO L430 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash 213094778, now seen corresponding path program 37 times [2021-06-05 21:45:11,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:11,038 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782783308] [2021-06-05 21:45:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:11,320 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:11,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782783308] [2021-06-05 21:45:11,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782783308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:11,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337886050] [2021-06-05 21:45:11,320 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:11,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:11,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:11,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:11,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:11,464 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:11,465 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:11,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:11,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:11,469 INFO L388 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 11 [2021-06-05 21:45:11,469 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:11,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:11,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:11,473 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:11,474 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:11,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:11,477 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:11,478 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:11,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:11,532 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:11,532 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:165 [2021-06-05 21:45:11,962 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_191, v_prenex_193, v_prenex_195, array_2, v_prenex_197, v_prenex_189], 1=[v_prenex_190, v_prenex_192, v_prenex_194, v_prenex_196, array_4, v_prenex_198]} [2021-06-05 21:45:11,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:11,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:11,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:45:11,980 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,145 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 90 [2021-06-05 21:45:12,146 INFO L628 ElimStorePlain]: treesize reduction 196, result has 53.0 percent of original size [2021-06-05 21:45:12,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:12,152 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:12,224 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:12,286 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:45:12,291 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:12,346 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:12,401 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:12,454 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:12,455 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:12,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,503 INFO L518 ElimStorePlain]: Eliminatee v_prenex_192 vanished before elimination [2021-06-05 21:45:12,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:12,507 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:12,508 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,557 INFO L518 ElimStorePlain]: Eliminatee v_prenex_196 vanished before elimination [2021-06-05 21:45:12,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:12,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:12,562 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:12,563 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:12,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:12,567 INFO L388 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 [2021-06-05 21:45:12,568 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:12,629 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:12,634 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:12,634 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:12,679 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:12,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:45:12,689 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:435, output treesize:67 [2021-06-05 21:45:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:12,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337886050] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:12,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:12,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:45:12,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480133420] [2021-06-05 21:45:12,749 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:12,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:12,749 INFO L87 Difference]: Start difference. First operand 306 states and 944 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:13,733 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2021-06-05 21:45:13,998 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2021-06-05 21:45:14,303 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 112 [2021-06-05 21:45:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:14,395 INFO L93 Difference]: Finished difference Result 375 states and 1128 transitions. [2021-06-05 21:45:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 21:45:14,396 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:14,396 INFO L225 Difference]: With dead ends: 375 [2021-06-05 21:45:14,396 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 21:45:14,396 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1767.9ms TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:45:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 21:45:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 308. [2021-06-05 21:45:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.0912052117263844) internal successors, (949), 307 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 949 transitions. [2021-06-05 21:45:14,400 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 949 transitions. Word has length 17 [2021-06-05 21:45:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:14,400 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 949 transitions. [2021-06-05 21:45:14,400 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 949 transitions. [2021-06-05 21:45:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:14,400 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:14,400 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:14,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable984,184 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:14,601 INFO L430 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1694332648, now seen corresponding path program 38 times [2021-06-05 21:45:14,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:14,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416313831] [2021-06-05 21:45:14,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:14,890 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:14,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416313831] [2021-06-05 21:45:14,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416313831] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:14,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026854525] [2021-06-05 21:45:14,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:14,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:45:14,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:14,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:45:14,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:15,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:15,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:15,025 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:15,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:15,058 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:45:15,061 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:15,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:15,088 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:100 [2021-06-05 21:45:15,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,194 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:15,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,200 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:15,201 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,207 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:15,208 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,212 INFO L388 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 38 treesize of output 30 [2021-06-05 21:45:15,214 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,302 INFO L628 ElimStorePlain]: treesize reduction 135, result has 41.6 percent of original size [2021-06-05 21:45:15,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,307 INFO L388 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 [2021-06-05 21:45:15,309 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:15,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,313 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:15,314 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:15,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,352 INFO L388 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 28 treesize of output 22 [2021-06-05 21:45:15,353 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,384 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:15,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:15,392 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:15,393 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:15,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:15,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:15,422 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:265, output treesize:38 [2021-06-05 21:45:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:15,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026854525] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:15,462 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:15,463 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:45:15,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131116201] [2021-06-05 21:45:15,463 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:45:15,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:45:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:45:15,463 INFO L87 Difference]: Start difference. First operand 308 states and 949 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:16,343 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2021-06-05 21:45:16,661 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2021-06-05 21:45:16,824 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2021-06-05 21:45:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:16,909 INFO L93 Difference]: Finished difference Result 370 states and 1110 transitions. [2021-06-05 21:45:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 21:45:16,910 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:16,910 INFO L225 Difference]: With dead ends: 370 [2021-06-05 21:45:16,910 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 21:45:16,910 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1475.4ms TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:45:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 21:45:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 301. [2021-06-05 21:45:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 21:45:16,914 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 21:45:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:16,914 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 21:45:16,914 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 21:45:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:16,914 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:16,914 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:17,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 185 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1015 [2021-06-05 21:45:17,115 INFO L430 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:17,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1115333512, now seen corresponding path program 39 times [2021-06-05 21:45:17,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:17,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801297594] [2021-06-05 21:45:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:17,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:17,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801297594] [2021-06-05 21:45:17,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801297594] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:17,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039734731] [2021-06-05 21:45:17,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:17,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:45:17,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:17,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:17,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:17,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:17,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:17,479 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:17,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:17,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:17,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:17,484 INFO L388 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 11 [2021-06-05 21:45:17,485 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:17,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:17,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:17,488 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:17,489 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:17,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:17,492 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:17,493 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:17,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:17,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:17,542 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:139 [2021-06-05 21:45:17,809 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2021-06-05 21:45:18,104 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_218, array_2, v_prenex_210, v_prenex_212, v_prenex_214, v_prenex_216], 1=[v_prenex_217, v_prenex_219, array_4, v_prenex_211, v_prenex_213, v_prenex_215]} [2021-06-05 21:45:18,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:18,113 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:45:18,121 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,347 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2021-06-05 21:45:18,347 INFO L628 ElimStorePlain]: treesize reduction 192, result has 53.5 percent of original size [2021-06-05 21:45:18,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:18,361 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:18,446 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:18,518 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:45:18,523 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,580 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:18,585 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:18,646 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,700 INFO L518 ElimStorePlain]: Eliminatee v_prenex_217 vanished before elimination [2021-06-05 21:45:18,700 INFO L518 ElimStorePlain]: Eliminatee v_prenex_219 vanished before elimination [2021-06-05 21:45:18,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:18,705 INFO L388 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 [2021-06-05 21:45:18,706 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:18,760 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:18,765 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:18,765 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:18,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:18,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:18,824 INFO L388 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 [2021-06-05 21:45:18,825 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:18,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:18,829 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:18,830 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:18,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:18,885 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:18,886 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:18,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:18,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 21:45:18,939 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:431, output treesize:81 [2021-06-05 21:45:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:18,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039734731] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:18,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:18,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:45:18,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416635232] [2021-06-05 21:45:18,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:18,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:18,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:18,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:18,997 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:19,299 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-06-05 21:45:19,697 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2021-06-05 21:45:19,895 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 21:45:20,561 WARN L205 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 142 [2021-06-05 21:45:20,933 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 126 [2021-06-05 21:45:21,112 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2021-06-05 21:45:21,550 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 119 [2021-06-05 21:45:21,893 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2021-06-05 21:45:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:22,004 INFO L93 Difference]: Finished difference Result 489 states and 1426 transitions. [2021-06-05 21:45:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 21:45:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:22,005 INFO L225 Difference]: With dead ends: 489 [2021-06-05 21:45:22,005 INFO L226 Difference]: Without dead ends: 458 [2021-06-05 21:45:22,005 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3230.7ms TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-06-05 21:45:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-06-05 21:45:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 301. [2021-06-05 21:45:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 21:45:22,008 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 21:45:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:22,008 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 21:45:22,008 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 21:45:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:22,009 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:22,009 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:22,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027,186 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:22,209 INFO L430 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:22,210 INFO L82 PathProgramCache]: Analyzing trace with hash 672434372, now seen corresponding path program 40 times [2021-06-05 21:45:22,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:22,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502880642] [2021-06-05 21:45:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:22,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:22,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502880642] [2021-06-05 21:45:22,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502880642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:22,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391846460] [2021-06-05 21:45:22,633 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:22,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:45:22,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:22,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:22,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:22,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:22,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:22,765 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:22,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:22,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:22,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:22,770 INFO L388 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 11 [2021-06-05 21:45:22,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:22,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:22,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:22,776 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:22,777 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:22,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:22,780 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:22,781 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:22,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:22,840 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:22,840 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:143 [2021-06-05 21:45:23,350 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_229, array_2, v_prenex_231, v_prenex_233, v_prenex_235, v_prenex_227], 1=[v_prenex_228, v_prenex_230, array_4, v_prenex_232, v_prenex_234, v_prenex_236]} [2021-06-05 21:45:23,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:23,357 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:23,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:45:23,373 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:23,536 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2021-06-05 21:45:23,536 INFO L628 ElimStorePlain]: treesize reduction 203, result has 49.8 percent of original size [2021-06-05 21:45:23,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:23,541 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:23,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:23,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:23,603 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:23,657 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:23,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:23,662 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:23,715 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:23,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:23,720 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:23,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:23,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:23,777 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:23,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:23,827 INFO L518 ElimStorePlain]: Eliminatee v_prenex_228 vanished before elimination [2021-06-05 21:45:23,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:23,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:23,832 INFO L388 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 [2021-06-05 21:45:23,833 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:23,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:23,840 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:23,841 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:23,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:23,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:23,895 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:23,896 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:23,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:23,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:23,949 INFO L388 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 [2021-06-05 21:45:23,951 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:24,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:24,000 INFO L518 ElimStorePlain]: Eliminatee v_prenex_234 vanished before elimination [2021-06-05 21:45:24,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:24,004 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:24,005 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:24,052 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:24,055 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:45:24,055 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:431, output treesize:67 [2021-06-05 21:45:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:24,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391846460] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:24,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:24,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:45:24,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086016917] [2021-06-05 21:45:24,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:24,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:24,117 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:24,526 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-06-05 21:45:24,926 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2021-06-05 21:45:25,155 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2021-06-05 21:45:25,778 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 136 [2021-06-05 21:45:26,189 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 123 [2021-06-05 21:45:26,386 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 21:45:26,841 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2021-06-05 21:45:27,170 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2021-06-05 21:45:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:27,308 INFO L93 Difference]: Finished difference Result 483 states and 1377 transitions. [2021-06-05 21:45:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 21:45:27,309 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:27,309 INFO L225 Difference]: With dead ends: 483 [2021-06-05 21:45:27,309 INFO L226 Difference]: Without dead ends: 437 [2021-06-05 21:45:27,310 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3446.8ms TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2021-06-05 21:45:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-06-05 21:45:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 305. [2021-06-05 21:45:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.0921052631578947) internal successors, (940), 304 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 940 transitions. [2021-06-05 21:45:27,313 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 940 transitions. Word has length 17 [2021-06-05 21:45:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:27,313 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 940 transitions. [2021-06-05 21:45:27,313 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 940 transitions. [2021-06-05 21:45:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:27,314 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:27,314 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:27,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1059,187 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:27,514 INFO L430 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1633532686, now seen corresponding path program 41 times [2021-06-05 21:45:27,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:27,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975358082] [2021-06-05 21:45:27,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:27,960 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:27,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975358082] [2021-06-05 21:45:27,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975358082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:27,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461257242] [2021-06-05 21:45:27,960 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:27,987 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:45:27,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:27,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 21:45:27,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:28,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,158 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:28,159 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,162 INFO L388 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 11 [2021-06-05 21:45:28,163 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:28,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,205 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:28,206 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,209 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:28,210 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:28,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:28,247 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:107 [2021-06-05 21:45:28,421 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_242, v_prenex_244, v_prenex_246], 1=[array_4, v_prenex_243, v_prenex_245, v_prenex_247]} [2021-06-05 21:45:28,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:28,427 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,526 INFO L628 ElimStorePlain]: treesize reduction 113, result has 48.6 percent of original size [2021-06-05 21:45:28,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:28,530 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:28,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:28,559 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:28,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:28,586 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,608 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:28,608 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:45:28,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,611 INFO L388 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 [2021-06-05 21:45:28,613 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:28,634 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:28,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,637 INFO L388 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 [2021-06-05 21:45:28,638 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:28,660 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:28,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:28,663 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:28,663 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:28,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:28,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:28,685 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 21:45:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:28,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461257242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:28,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:28,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:45:28,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272064709] [2021-06-05 21:45:28,725 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:28,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:28,726 INFO L87 Difference]: Start difference. First operand 305 states and 940 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:29,160 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2021-06-05 21:45:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:29,753 INFO L93 Difference]: Finished difference Result 380 states and 1151 transitions. [2021-06-05 21:45:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 21:45:29,754 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:29,754 INFO L225 Difference]: With dead ends: 380 [2021-06-05 21:45:29,754 INFO L226 Difference]: Without dead ends: 370 [2021-06-05 21:45:29,754 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1258.1ms TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:45:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-05 21:45:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 307. [2021-06-05 21:45:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 3.0915032679738563) internal successors, (946), 306 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 946 transitions. [2021-06-05 21:45:29,759 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 946 transitions. Word has length 17 [2021-06-05 21:45:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:29,759 INFO L482 AbstractCegarLoop]: Abstraction has 307 states and 946 transitions. [2021-06-05 21:45:29,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 946 transitions. [2021-06-05 21:45:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:29,760 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:29,760 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:29,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1093,188 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:29,982 INFO L430 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1560160206, now seen corresponding path program 42 times [2021-06-05 21:45:29,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:29,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849968771] [2021-06-05 21:45:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:30,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:30,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849968771] [2021-06-05 21:45:30,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849968771] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:30,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226042375] [2021-06-05 21:45:30,290 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:30,327 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:45:30,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:30,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:30,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:30,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,514 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:30,515 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,519 INFO L388 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 11 [2021-06-05 21:45:30,520 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:30,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,577 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:30,578 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,582 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:30,583 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:30,635 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:30,635 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:162 [2021-06-05 21:45:30,785 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 21:45:30,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,798 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:30,799 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,806 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:30,807 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,813 INFO L388 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 11 [2021-06-05 21:45:30,814 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,819 INFO L388 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 29 treesize of output 23 [2021-06-05 21:45:30,820 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,824 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:30,825 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,830 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:30,830 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,835 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:30,836 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,840 INFO L388 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 39 treesize of output 31 [2021-06-05 21:45:30,841 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,990 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2021-06-05 21:45:30,990 INFO L628 ElimStorePlain]: treesize reduction 146, result has 56.7 percent of original size [2021-06-05 21:45:30,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:30,995 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:30,996 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:30,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:31,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:31,000 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:31,001 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:31,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:31,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:31,007 INFO L388 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 25 treesize of output 17 [2021-06-05 21:45:31,008 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:31,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:31,013 INFO L388 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 [2021-06-05 21:45:31,015 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:31,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:31,073 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:45:31,073 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:411, output treesize:101 [2021-06-05 21:45:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:31,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226042375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:31,200 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:31,200 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:45:31,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508519828] [2021-06-05 21:45:31,200 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:31,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:31,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:31,201 INFO L87 Difference]: Start difference. First operand 307 states and 946 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:31,782 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2021-06-05 21:45:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:31,913 INFO L93 Difference]: Finished difference Result 358 states and 1087 transitions. [2021-06-05 21:45:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:45:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:31,913 INFO L225 Difference]: With dead ends: 358 [2021-06-05 21:45:31,913 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 21:45:31,914 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 906.7ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:45:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 21:45:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 301. [2021-06-05 21:45:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 21:45:31,917 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 21:45:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:31,917 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 21:45:31,917 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 21:45:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:31,917 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:31,917 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:32,117 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118,189 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:32,118 INFO L430 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:32,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1698524914, now seen corresponding path program 43 times [2021-06-05 21:45:32,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:32,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149809595] [2021-06-05 21:45:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:32,488 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:32,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149809595] [2021-06-05 21:45:32,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149809595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:32,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067373362] [2021-06-05 21:45:32,488 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:32,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:45:32,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:32,661 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_254], 3=[array_0]} [2021-06-05 21:45:32,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:32,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:32,667 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:32,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:32,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:32,671 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:32,672 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:32,707 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:32,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:32,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:32,711 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:32,712 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:32,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:32,716 INFO L388 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 11 [2021-06-05 21:45:32,716 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:32,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:32,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:32,751 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:149, output treesize:113 [2021-06-05 21:45:32,901 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_261, v_prenex_257, v_prenex_259], 1=[v_prenex_260, v_prenex_262, array_4, v_prenex_258]} [2021-06-05 21:45:32,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:32,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:32,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:45:32,913 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:33,012 INFO L628 ElimStorePlain]: treesize reduction 85, result has 63.8 percent of original size [2021-06-05 21:45:33,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:33,021 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:33,061 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:33,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:45:33,065 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:33,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:33,069 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:33,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:33,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:33,107 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:33,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:33,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:33,143 INFO L388 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 [2021-06-05 21:45:33,144 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:33,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:33,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:33,180 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:33,181 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:33,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:33,213 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:45:33,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:33,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:33,217 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:33,219 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:33,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:33,222 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:33,223 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:33,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:33,256 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:45:33,256 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:253, output treesize:48 [2021-06-05 21:45:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:33,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067373362] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:33,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:33,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:45:33,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323109456] [2021-06-05 21:45:33,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:33,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:33,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:33,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:33,311 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:33,936 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 21:45:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:34,039 INFO L93 Difference]: Finished difference Result 357 states and 1080 transitions. [2021-06-05 21:45:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:45:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:34,040 INFO L225 Difference]: With dead ends: 357 [2021-06-05 21:45:34,040 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 21:45:34,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 944.9ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:45:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 21:45:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 303. [2021-06-05 21:45:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 21:45:34,043 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 21:45:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:34,043 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 21:45:34,043 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 21:45:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:34,044 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:34,044 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:34,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1142,190 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:34,244 INFO L430 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:34,245 INFO L82 PathProgramCache]: Analyzing trace with hash -217287044, now seen corresponding path program 44 times [2021-06-05 21:45:34,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:34,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841170408] [2021-06-05 21:45:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:34,448 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:34,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841170408] [2021-06-05 21:45:34,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841170408] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:34,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276252889] [2021-06-05 21:45:34,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:34,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:45:34,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:34,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:45:34,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:34,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:34,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:34,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:34,580 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:34,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:34,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:45:34,614 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:34,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:34,617 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:34,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:34,643 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:34,643 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:90 [2021-06-05 21:45:34,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:34,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:34,822 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:34,823 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:34,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:34,828 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:34,828 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:34,894 INFO L628 ElimStorePlain]: treesize reduction 108, result has 45.7 percent of original size [2021-06-05 21:45:34,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:34,897 INFO L388 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 19 treesize of output 15 [2021-06-05 21:45:34,898 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:34,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:34,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:34,933 INFO L388 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 [2021-06-05 21:45:34,934 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:34,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:34,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:34,960 INFO L388 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 [2021-06-05 21:45:34,961 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:34,983 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:34,983 INFO L518 ElimStorePlain]: Eliminatee v_prenex_264 vanished before elimination [2021-06-05 21:45:34,983 INFO L518 ElimStorePlain]: Eliminatee v_prenex_265 vanished before elimination [2021-06-05 21:45:34,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:34,986 INFO L388 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 18 treesize of output 14 [2021-06-05 21:45:34,987 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:35,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:35,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:35,010 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:35,012 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:35,032 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:35,034 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:35,034 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:221, output treesize:38 [2021-06-05 21:45:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:35,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276252889] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:35,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:35,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:45:35,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577494995] [2021-06-05 21:45:35,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:45:35,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:45:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:45:35,074 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:35,651 INFO L93 Difference]: Finished difference Result 355 states and 1076 transitions. [2021-06-05 21:45:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:45:35,651 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:35,651 INFO L225 Difference]: With dead ends: 355 [2021-06-05 21:45:35,651 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 21:45:35,652 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 713.8ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:45:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 21:45:35,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 302. [2021-06-05 21:45:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.0930232558139537) internal successors, (931), 301 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 931 transitions. [2021-06-05 21:45:35,655 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 931 transitions. Word has length 17 [2021-06-05 21:45:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:35,655 INFO L482 AbstractCegarLoop]: Abstraction has 302 states and 931 transitions. [2021-06-05 21:45:35,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 931 transitions. [2021-06-05 21:45:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:35,655 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:35,655 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:35,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1171,191 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:35,856 INFO L430 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:35,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:35,856 INFO L82 PathProgramCache]: Analyzing trace with hash 331629366, now seen corresponding path program 45 times [2021-06-05 21:45:35,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:35,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335765087] [2021-06-05 21:45:35,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:36,131 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-06-05 21:45:36,268 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 21:45:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:36,475 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:36,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335765087] [2021-06-05 21:45:36,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335765087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:36,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609164100] [2021-06-05 21:45:36,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:36,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:45:36,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:36,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:45:36,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:36,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:36,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:36,653 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:36,653 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:36,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:36,657 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:36,657 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:36,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:36,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:36,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:36,698 INFO L388 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 11 [2021-06-05 21:45:36,699 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:36,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:36,702 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:36,702 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:36,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:36,736 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:36,736 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 21:45:36,909 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_281, array_2, v_prenex_277, v_prenex_279], 1=[v_prenex_280, v_prenex_282, array_4, v_prenex_278]} [2021-06-05 21:45:36,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:36,914 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:36,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:36,919 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:37,013 INFO L628 ElimStorePlain]: treesize reduction 85, result has 62.6 percent of original size [2021-06-05 21:45:37,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:37,018 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:37,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:37,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:45:37,059 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:37,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:37,063 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:37,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:37,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:37,100 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:37,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:37,132 INFO L518 ElimStorePlain]: Eliminatee v_prenex_280 vanished before elimination [2021-06-05 21:45:37,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:37,135 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:37,136 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:37,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:37,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:37,171 INFO L388 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 13 treesize of output 9 [2021-06-05 21:45:37,172 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:37,203 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:37,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:37,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:37,208 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:37,209 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:37,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:37,212 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:37,214 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:37,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:37,258 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:45:37,258 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:243, output treesize:48 [2021-06-05 21:45:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:37,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609164100] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:37,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:37,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:45:37,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451381736] [2021-06-05 21:45:37,316 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:37,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:37,316 INFO L87 Difference]: Start difference. First operand 302 states and 931 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:37,835 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2021-06-05 21:45:38,020 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2021-06-05 21:45:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:38,120 INFO L93 Difference]: Finished difference Result 354 states and 1074 transitions. [2021-06-05 21:45:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:45:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:38,121 INFO L225 Difference]: With dead ends: 354 [2021-06-05 21:45:38,121 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 21:45:38,121 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1248.0ms TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:45:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 21:45:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 304. [2021-06-05 21:45:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.092409240924092) internal successors, (937), 303 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 937 transitions. [2021-06-05 21:45:38,124 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 937 transitions. Word has length 17 [2021-06-05 21:45:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:38,124 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 937 transitions. [2021-06-05 21:45:38,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 937 transitions. [2021-06-05 21:45:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:38,124 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:38,124 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:38,325 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1213,192 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:38,325 INFO L430 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:38,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:38,325 INFO L82 PathProgramCache]: Analyzing trace with hash -483176788, now seen corresponding path program 46 times [2021-06-05 21:45:38,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:38,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122549951] [2021-06-05 21:45:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:38,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:38,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122549951] [2021-06-05 21:45:38,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122549951] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:38,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889510339] [2021-06-05 21:45:38,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:38,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:45:38,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:38,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:45:38,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:38,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:38,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:38,889 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:38,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:38,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:38,893 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:38,894 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:38,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:38,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:38,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:38,935 INFO L388 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 11 [2021-06-05 21:45:38,936 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:38,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:38,939 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:38,940 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:38,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:38,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:38,976 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:113 [2021-06-05 21:45:39,091 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_291, v_prenex_293, array_2, v_prenex_289], 1=[v_prenex_290, v_prenex_292, array_0, v_prenex_288]} [2021-06-05 21:45:39,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:39,096 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:39,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:39,101 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:39,167 INFO L628 ElimStorePlain]: treesize reduction 123, result has 45.3 percent of original size [2021-06-05 21:45:39,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:39,171 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:39,194 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:39,194 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:45:39,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:39,197 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:39,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:39,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:39,222 INFO L388 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 [2021-06-05 21:45:39,224 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:39,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:39,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:39,248 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:39,249 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:39,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:39,270 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:45:39,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:39,275 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:39,276 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:39,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:39,299 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:39,299 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 21:45:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:39,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889510339] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:39,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:39,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:45:39,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876761315] [2021-06-05 21:45:39,342 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:39,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:39,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:39,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:39,342 INFO L87 Difference]: Start difference. First operand 304 states and 937 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:39,961 INFO L93 Difference]: Finished difference Result 368 states and 1120 transitions. [2021-06-05 21:45:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:45:39,962 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:39,962 INFO L225 Difference]: With dead ends: 368 [2021-06-05 21:45:39,962 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 21:45:39,962 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 778.9ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:45:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 21:45:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 303. [2021-06-05 21:45:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 21:45:39,965 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 21:45:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:39,966 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 21:45:39,966 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 21:45:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:39,966 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:39,966 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:40,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 193 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1238 [2021-06-05 21:45:40,167 INFO L430 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash 538722348, now seen corresponding path program 47 times [2021-06-05 21:45:40,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:40,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33700570] [2021-06-05 21:45:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:40,549 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:40,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33700570] [2021-06-05 21:45:40,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33700570] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:40,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292926236] [2021-06-05 21:45:40,549 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:40,577 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:45:40,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:40,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:45:40,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:40,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:45:40,667 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:40,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:40,670 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:40,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:40,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:40,703 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:40,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:40,706 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:40,731 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:40,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:40,732 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:90 [2021-06-05 21:45:40,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:40,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:40,892 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:40,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:40,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:40,898 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:40,898 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:40,969 INFO L628 ElimStorePlain]: treesize reduction 108, result has 47.3 percent of original size [2021-06-05 21:45:40,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:40,973 INFO L388 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 19 treesize of output 15 [2021-06-05 21:45:40,973 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:40,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:40,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:40,999 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:41,000 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:41,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:41,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:41,025 INFO L388 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 [2021-06-05 21:45:41,026 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:41,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:41,049 INFO L518 ElimStorePlain]: Eliminatee v_prenex_298 vanished before elimination [2021-06-05 21:45:41,049 INFO L518 ElimStorePlain]: Eliminatee v_prenex_299 vanished before elimination [2021-06-05 21:45:41,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:41,052 INFO L388 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 18 treesize of output 14 [2021-06-05 21:45:41,052 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:41,073 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:41,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:41,076 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:41,077 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:41,097 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:41,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:41,099 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:221, output treesize:38 [2021-06-05 21:45:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:41,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292926236] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:41,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:41,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:45:41,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705017726] [2021-06-05 21:45:41,138 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:45:41,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:45:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:45:41,139 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:41,707 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2021-06-05 21:45:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:41,791 INFO L93 Difference]: Finished difference Result 354 states and 1076 transitions. [2021-06-05 21:45:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:45:41,792 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:41,792 INFO L225 Difference]: With dead ends: 354 [2021-06-05 21:45:41,792 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 21:45:41,793 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 872.0ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:45:41,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 21:45:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 305. [2021-06-05 21:45:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.0953947368421053) internal successors, (941), 304 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 941 transitions. [2021-06-05 21:45:41,796 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 941 transitions. Word has length 17 [2021-06-05 21:45:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:41,796 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 941 transitions. [2021-06-05 21:45:41,796 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 941 transitions. [2021-06-05 21:45:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:41,796 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:41,796 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:41,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1263,194 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:41,997 INFO L430 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash 881305860, now seen corresponding path program 48 times [2021-06-05 21:45:41,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:41,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429419062] [2021-06-05 21:45:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:42,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:42,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429419062] [2021-06-05 21:45:42,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429419062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:42,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885781861] [2021-06-05 21:45:42,235 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:42,267 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 21:45:42,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:42,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:42,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:42,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,362 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:42,363 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,367 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:42,368 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,372 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:42,373 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,376 INFO L388 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 11 [2021-06-05 21:45:42,377 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:42,433 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:42,433 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:155 [2021-06-05 21:45:42,541 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_305, v_prenex_307, v_prenex_309, array_2], 1=[v_prenex_306, array_0, v_prenex_308, v_prenex_304]} [2021-06-05 21:45:42,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:42,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:45:42,551 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,696 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2021-06-05 21:45:42,696 INFO L628 ElimStorePlain]: treesize reduction 151, result has 55.6 percent of original size [2021-06-05 21:45:42,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:42,701 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 21:45:42,705 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:42,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:42,767 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:42,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:42,828 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:42,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,888 INFO L388 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 24 treesize of output 16 [2021-06-05 21:45:42,889 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:42,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,893 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:42,894 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:42,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:42,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:42,952 INFO L388 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 12 treesize of output 8 [2021-06-05 21:45:42,953 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:43,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:43,006 INFO L518 ElimStorePlain]: Eliminatee v_prenex_308 vanished before elimination [2021-06-05 21:45:43,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:43,009 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:43,011 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:43,062 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:43,063 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:45:43,063 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:359, output treesize:124 [2021-06-05 21:45:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:43,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885781861] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:43,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:43,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:45:43,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579785923] [2021-06-05 21:45:43,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:43,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:43,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:43,232 INFO L87 Difference]: Start difference. First operand 305 states and 941 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:43,584 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 21:45:43,730 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-06-05 21:45:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:43,799 INFO L93 Difference]: Finished difference Result 352 states and 1070 transitions. [2021-06-05 21:45:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:45:43,799 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:43,800 INFO L225 Difference]: With dead ends: 352 [2021-06-05 21:45:43,800 INFO L226 Difference]: Without dead ends: 341 [2021-06-05 21:45:43,800 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 810.9ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:45:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-06-05 21:45:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 303. [2021-06-05 21:45:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 21:45:43,803 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 21:45:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:43,803 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 21:45:43,803 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 21:45:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:43,804 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:43,804 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:44,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1305 [2021-06-05 21:45:44,004 INFO L430 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1017508532, now seen corresponding path program 49 times [2021-06-05 21:45:44,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:44,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108692256] [2021-06-05 21:45:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:44,396 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:44,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108692256] [2021-06-05 21:45:44,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108692256] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:44,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878561019] [2021-06-05 21:45:44,396 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:44,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:44,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:44,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:44,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:44,557 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:44,558 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:44,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:44,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:44,564 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:44,565 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:44,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:44,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:44,570 INFO L388 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 11 [2021-06-05 21:45:44,571 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:44,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:44,576 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:44,577 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:44,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:44,641 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:44,641 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:159 [2021-06-05 21:45:45,215 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_327, v_prenex_329, array_2, v_prenex_321, v_prenex_323, v_prenex_325], 1=[v_prenex_328, array_4, v_prenex_330, v_prenex_322, v_prenex_324, v_prenex_326]} [2021-06-05 21:45:45,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:45,222 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:45:45,228 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,397 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2021-06-05 21:45:45,397 INFO L628 ElimStorePlain]: treesize reduction 204, result has 50.5 percent of original size [2021-06-05 21:45:45,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:45,403 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,461 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:45,466 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,523 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:45,528 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:45:45,589 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:45,647 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:45,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:45,704 INFO L388 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 [2021-06-05 21:45:45,705 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:45,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:45,709 INFO L388 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 25 treesize of output 17 [2021-06-05 21:45:45,710 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,759 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:45,763 INFO L388 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 [2021-06-05 21:45:45,764 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:45,813 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,813 INFO L518 ElimStorePlain]: Eliminatee v_prenex_330 vanished before elimination [2021-06-05 21:45:45,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:45,817 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:45,818 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:45,866 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,866 INFO L518 ElimStorePlain]: Eliminatee v_prenex_324 vanished before elimination [2021-06-05 21:45:45,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:45,870 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:45,871 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:45,919 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:45,921 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 21:45:45,922 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:431, output treesize:75 [2021-06-05 21:45:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:45,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878561019] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:45,985 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:45,985 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:45:45,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525133648] [2021-06-05 21:45:45,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:45,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:45,986 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:46,519 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2021-06-05 21:45:46,923 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 100 [2021-06-05 21:45:47,675 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 151 [2021-06-05 21:45:48,142 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 114 [2021-06-05 21:45:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:48,212 INFO L93 Difference]: Finished difference Result 483 states and 1414 transitions. [2021-06-05 21:45:48,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:45:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:48,213 INFO L225 Difference]: With dead ends: 483 [2021-06-05 21:45:48,213 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 21:45:48,213 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2609.7ms TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:45:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 21:45:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 327. [2021-06-05 21:45:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 3.1165644171779143) internal successors, (1016), 326 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1016 transitions. [2021-06-05 21:45:48,220 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 1016 transitions. Word has length 17 [2021-06-05 21:45:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:48,220 INFO L482 AbstractCegarLoop]: Abstraction has 327 states and 1016 transitions. [2021-06-05 21:45:48,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 1016 transitions. [2021-06-05 21:45:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:48,221 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:48,221 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:48,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1325,196 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:48,421 INFO L430 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1698860488, now seen corresponding path program 50 times [2021-06-05 21:45:48,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:48,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538486971] [2021-06-05 21:45:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:48,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:48,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538486971] [2021-06-05 21:45:48,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538486971] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:48,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360281390] [2021-06-05 21:45:48,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:48,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:45:48,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:48,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:45:48,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:49,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,064 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:49,064 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,068 INFO L388 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 11 [2021-06-05 21:45:49,068 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:49,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,107 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:49,108 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,111 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:49,111 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:49,143 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:49,143 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:105 [2021-06-05 21:45:49,366 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_339, array_2, v_prenex_335, v_prenex_337], 1=[v_prenex_338, array_4, v_prenex_340, v_prenex_336]} [2021-06-05 21:45:49,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:49,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:49,376 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,444 INFO L628 ElimStorePlain]: treesize reduction 119, result has 46.2 percent of original size [2021-06-05 21:45:49,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:49,448 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:49,471 INFO L518 ElimStorePlain]: Eliminatee v_prenex_335 vanished before elimination [2021-06-05 21:45:49,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:49,474 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:49,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,500 INFO L388 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 [2021-06-05 21:45:49,501 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:49,534 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:49,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,537 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:49,538 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:49,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:49,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:49,561 INFO L388 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 [2021-06-05 21:45:49,563 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:49,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:49,583 INFO L518 ElimStorePlain]: Eliminatee v_prenex_336 vanished before elimination [2021-06-05 21:45:49,585 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:49,585 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 21:45:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:49,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360281390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:49,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:49,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:45:49,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638199217] [2021-06-05 21:45:49,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:49,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:49,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:49,627 INFO L87 Difference]: Start difference. First operand 327 states and 1016 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:49,896 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-06-05 21:45:50,167 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2021-06-05 21:45:50,691 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 118 [2021-06-05 21:45:51,207 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 116 [2021-06-05 21:45:51,491 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2021-06-05 21:45:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:51,838 INFO L93 Difference]: Finished difference Result 544 states and 1579 transitions. [2021-06-05 21:45:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:45:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:51,839 INFO L225 Difference]: With dead ends: 544 [2021-06-05 21:45:51,839 INFO L226 Difference]: Without dead ends: 512 [2021-06-05 21:45:51,839 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2265.8ms TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:45:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-06-05 21:45:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 336. [2021-06-05 21:45:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 3.1671641791044776) internal successors, (1061), 335 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1061 transitions. [2021-06-05 21:45:51,844 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1061 transitions. Word has length 17 [2021-06-05 21:45:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:51,844 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 1061 transitions. [2021-06-05 21:45:51,844 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1061 transitions. [2021-06-05 21:45:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:51,844 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:51,844 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:52,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1358 [2021-06-05 21:45:52,045 INFO L430 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash -56410218, now seen corresponding path program 51 times [2021-06-05 21:45:52,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:52,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013935833] [2021-06-05 21:45:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:52,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:52,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013935833] [2021-06-05 21:45:52,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013935833] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:52,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898309312] [2021-06-05 21:45:52,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:52,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:45:52,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:52,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:45:52,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:52,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:52,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:52,634 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:52,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:52,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:52,638 INFO L388 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 11 [2021-06-05 21:45:52,639 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:52,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:52,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:52,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:52,681 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:52,682 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:52,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:52,685 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:52,686 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:52,719 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:52,722 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:52,722 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:113 [2021-06-05 21:45:52,877 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_349, array_2, v_prenex_345, v_prenex_347], 1=[v_prenex_350, array_4, v_prenex_346, v_prenex_348]} [2021-06-05 21:45:52,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:52,882 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:52,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:45:52,887 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:52,954 INFO L628 ElimStorePlain]: treesize reduction 119, result has 46.2 percent of original size [2021-06-05 21:45:52,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:45:52,958 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:52,982 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:52,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:52,986 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:53,013 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:53,013 INFO L518 ElimStorePlain]: Eliminatee v_prenex_347 vanished before elimination [2021-06-05 21:45:53,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:53,016 INFO L388 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 [2021-06-05 21:45:53,017 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:53,039 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:53,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:53,042 INFO L388 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 [2021-06-05 21:45:53,043 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:53,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:53,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:53,067 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:53,068 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:53,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:53,089 INFO L518 ElimStorePlain]: Eliminatee v_prenex_348 vanished before elimination [2021-06-05 21:45:53,090 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:53,090 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 21:45:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:53,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898309312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:53,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:53,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:45:53,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547195095] [2021-06-05 21:45:53,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:53,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:53,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:53,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:53,130 INFO L87 Difference]: Start difference. First operand 336 states and 1061 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:53,557 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2021-06-05 21:45:53,739 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2021-06-05 21:45:53,946 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2021-06-05 21:45:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:54,152 INFO L93 Difference]: Finished difference Result 447 states and 1358 transitions. [2021-06-05 21:45:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:45:54,152 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:54,153 INFO L225 Difference]: With dead ends: 447 [2021-06-05 21:45:54,153 INFO L226 Difference]: Without dead ends: 435 [2021-06-05 21:45:54,153 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1173.1ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:45:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-06-05 21:45:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 340. [2021-06-05 21:45:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 3.1799410029498527) internal successors, (1078), 339 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1078 transitions. [2021-06-05 21:45:54,157 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1078 transitions. Word has length 17 [2021-06-05 21:45:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:54,157 INFO L482 AbstractCegarLoop]: Abstraction has 340 states and 1078 transitions. [2021-06-05 21:45:54,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1078 transitions. [2021-06-05 21:45:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:54,157 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:54,157 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:54,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1383,198 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:54,358 INFO L430 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash -129782698, now seen corresponding path program 52 times [2021-06-05 21:45:54,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:54,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473729296] [2021-06-05 21:45:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:54,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:54,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473729296] [2021-06-05 21:45:54,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473729296] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:54,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694908639] [2021-06-05 21:45:54,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:54,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:45:54,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:54,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:45:54,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:54,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:54,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:54,810 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:54,811 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:54,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:54,815 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:54,815 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:54,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:54,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:54,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:54,870 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:54,871 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:54,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:54,874 INFO L388 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 11 [2021-06-05 21:45:54,875 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:54,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:54,923 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:54,924 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:153 [2021-06-05 21:45:55,061 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 21:45:55,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,066 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:55,067 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,071 INFO L388 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 35 treesize of output 27 [2021-06-05 21:45:55,072 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,076 INFO L388 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 29 treesize of output 23 [2021-06-05 21:45:55,077 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,082 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:55,082 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,087 INFO L388 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 17 treesize of output 13 [2021-06-05 21:45:55,088 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,092 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:55,093 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,098 INFO L388 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 39 treesize of output 31 [2021-06-05 21:45:55,098 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,103 INFO L388 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 11 [2021-06-05 21:45:55,104 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,252 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2021-06-05 21:45:55,252 INFO L628 ElimStorePlain]: treesize reduction 133, result has 57.5 percent of original size [2021-06-05 21:45:55,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,257 INFO L388 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 [2021-06-05 21:45:55,258 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:55,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,262 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:55,263 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,268 INFO L388 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 10 treesize of output 6 [2021-06-05 21:45:55,270 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:55,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:55,274 INFO L388 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 25 treesize of output 17 [2021-06-05 21:45:55,274 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:55,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:55,337 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:45:55,337 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:393, output treesize:101 [2021-06-05 21:45:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:55,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694908639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:55,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:55,462 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:45:55,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578143678] [2021-06-05 21:45:55,462 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:45:55,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:55,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:45:55,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:45:55,462 INFO L87 Difference]: Start difference. First operand 340 states and 1078 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:56,048 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2021-06-05 21:45:56,212 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2021-06-05 21:45:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:45:56,367 INFO L93 Difference]: Finished difference Result 446 states and 1363 transitions. [2021-06-05 21:45:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 21:45:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:45:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:45:56,368 INFO L225 Difference]: With dead ends: 446 [2021-06-05 21:45:56,368 INFO L226 Difference]: Without dead ends: 433 [2021-06-05 21:45:56,369 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1057.6ms TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:45:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-06-05 21:45:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 341. [2021-06-05 21:45:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.1852941176470586) internal successors, (1083), 340 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1083 transitions. [2021-06-05 21:45:56,372 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1083 transitions. Word has length 17 [2021-06-05 21:45:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:45:56,372 INFO L482 AbstractCegarLoop]: Abstraction has 341 states and 1083 transitions. [2021-06-05 21:45:56,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1083 transitions. [2021-06-05 21:45:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:45:56,373 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:45:56,373 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:45:56,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1408,199 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:56,573 INFO L430 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:45:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:45:56,574 INFO L82 PathProgramCache]: Analyzing trace with hash -28866952, now seen corresponding path program 53 times [2021-06-05 21:45:56,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:45:56,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523597087] [2021-06-05 21:45:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:45:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:45:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:56,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:45:56,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523597087] [2021-06-05 21:45:56,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523597087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:56,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338550518] [2021-06-05 21:45:56,988 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:45:57,015 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:45:57,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:45:57,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 21:45:57,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:45:57,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,196 INFO L388 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 11 [2021-06-05 21:45:57,197 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,200 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:57,201 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,240 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:57,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,243 INFO L388 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 25 treesize of output 19 [2021-06-05 21:45:57,244 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,247 INFO L388 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 27 treesize of output 21 [2021-06-05 21:45:57,248 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,281 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:57,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:45:57,284 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:107 [2021-06-05 21:45:57,438 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_360, array_2, v_prenex_362, v_prenex_364], 1=[v_prenex_361, array_4, v_prenex_363, v_prenex_365]} [2021-06-05 21:45:57,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:45:57,444 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:45:57,448 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,518 INFO L628 ElimStorePlain]: treesize reduction 116, result has 46.3 percent of original size [2021-06-05 21:45:57,518 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:45:57,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:57,522 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:57,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:45:57,558 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:57,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,584 INFO L388 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 [2021-06-05 21:45:57,585 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:45:57,607 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:57,607 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:45:57,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,610 INFO L388 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 21 treesize of output 13 [2021-06-05 21:45:57,610 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:57,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:45:57,634 INFO L388 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 22 treesize of output 14 [2021-06-05 21:45:57,635 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:45:57,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:45:57,657 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:45:57,657 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 21:45:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:45:57,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338550518] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:45:57,697 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:45:57,697 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:45:57,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194098030] [2021-06-05 21:45:57,697 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:45:57,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:45:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:45:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:45:57,697 INFO L87 Difference]: Start difference. First operand 341 states and 1083 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:45:58,138 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2021-06-05 21:45:58,325 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2021-06-05 21:45:58,568 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 62 [2021-06-05 21:45:58,787 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2021-06-05 21:45:59,169 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 107 [2021-06-05 21:45:59,387 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2021-06-05 21:45:59,808 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 109 [2021-06-05 21:45:59,992 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-06-05 21:46:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:00,315 INFO L93 Difference]: Finished difference Result 671 states and 2008 transitions. [2021-06-05 21:46:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 21:46:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:00,317 INFO L225 Difference]: With dead ends: 671 [2021-06-05 21:46:00,317 INFO L226 Difference]: Without dead ends: 655 [2021-06-05 21:46:00,317 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2609.9ms TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:46:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-06-05 21:46:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 355. [2021-06-05 21:46:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.189265536723164) internal successors, (1129), 354 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1129 transitions. [2021-06-05 21:46:00,322 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1129 transitions. Word has length 17 [2021-06-05 21:46:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:00,322 INFO L482 AbstractCegarLoop]: Abstraction has 355 states and 1129 transitions. [2021-06-05 21:46:00,322 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1129 transitions. [2021-06-05 21:46:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:00,323 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:00,323 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:00,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 200 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1432 [2021-06-05 21:46:00,523 INFO L430 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:00,523 INFO L82 PathProgramCache]: Analyzing trace with hash -102239432, now seen corresponding path program 54 times [2021-06-05 21:46:00,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:00,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405603365] [2021-06-05 21:46:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:00,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:00,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405603365] [2021-06-05 21:46:00,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405603365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:00,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124731099] [2021-06-05 21:46:00,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:00,869 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:46:00,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:00,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:00,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:01,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,168 INFO L388 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 11 [2021-06-05 21:46:01,169 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,175 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:01,175 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,247 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:01,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,252 INFO L388 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 11 [2021-06-05 21:46:01,253 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,257 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:01,257 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:01,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,329 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:01,330 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:01,333 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:01,334 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:01,401 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 21:46:01,401 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:229, output treesize:181 [2021-06-05 21:46:01,683 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_390, v_prenex_380, v_prenex_382, v_prenex_393, array_2, v_prenex_384, v_prenex_396, v_prenex_374, v_prenex_387, v_prenex_376, v_prenex_399, v_prenex_378], 1=[array_0, v_prenex_381, v_prenex_392, v_prenex_383, v_prenex_395, v_prenex_373, v_prenex_386, v_prenex_375, v_prenex_398, v_prenex_377, v_prenex_389, v_prenex_379]} [2021-06-05 21:46:01,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:46:01,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,837 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 108 [2021-06-05 21:46:01,838 INFO L628 ElimStorePlain]: treesize reduction 192, result has 54.7 percent of original size [2021-06-05 21:46:01,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 21:46:01,844 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:01,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:01,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:01,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:01,972 INFO L518 ElimStorePlain]: Eliminatee v_prenex_393 vanished before elimination [2021-06-05 21:46:01,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:01,978 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:02,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,036 INFO L518 ElimStorePlain]: Eliminatee v_prenex_384 vanished before elimination [2021-06-05 21:46:02,036 INFO L518 ElimStorePlain]: Eliminatee v_prenex_396 vanished before elimination [2021-06-05 21:46:02,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:02,042 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:02,098 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:46:02,104 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:02,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:02,167 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:02,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,220 INFO L518 ElimStorePlain]: Eliminatee v_prenex_399 vanished before elimination [2021-06-05 21:46:02,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:02,224 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:02,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:02,279 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:02,280 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:02,331 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,331 INFO L518 ElimStorePlain]: Eliminatee v_prenex_381 vanished before elimination [2021-06-05 21:46:02,331 INFO L518 ElimStorePlain]: Eliminatee v_prenex_392 vanished before elimination [2021-06-05 21:46:02,331 INFO L518 ElimStorePlain]: Eliminatee v_prenex_383 vanished before elimination [2021-06-05 21:46:02,331 INFO L518 ElimStorePlain]: Eliminatee v_prenex_395 vanished before elimination [2021-06-05 21:46:02,331 INFO L518 ElimStorePlain]: Eliminatee v_prenex_373 vanished before elimination [2021-06-05 21:46:02,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:02,336 INFO L388 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 [2021-06-05 21:46:02,337 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:02,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:02,391 INFO L388 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 21 treesize of output 13 [2021-06-05 21:46:02,391 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:02,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,441 INFO L518 ElimStorePlain]: Eliminatee v_prenex_398 vanished before elimination [2021-06-05 21:46:02,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:02,445 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:02,446 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:02,494 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,494 INFO L518 ElimStorePlain]: Eliminatee v_prenex_389 vanished before elimination [2021-06-05 21:46:02,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:02,498 INFO L388 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 25 treesize of output 17 [2021-06-05 21:46:02,498 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:02,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:02,547 INFO L550 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 24 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 21:46:02,548 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 36 variables, input treesize:431, output treesize:81 [2021-06-05 21:46:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:02,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124731099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:02,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:02,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:46:02,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069192776] [2021-06-05 21:46:02,617 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:46:02,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:46:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:46:02,618 INFO L87 Difference]: Start difference. First operand 355 states and 1129 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:02,925 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2021-06-05 21:46:03,368 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2021-06-05 21:46:03,542 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2021-06-05 21:46:03,710 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2021-06-05 21:46:03,882 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 21:46:04,135 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 82 [2021-06-05 21:46:04,385 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2021-06-05 21:46:04,545 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 21:46:05,019 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 139 [2021-06-05 21:46:05,233 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-06-05 21:46:05,378 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 21:46:05,676 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2021-06-05 21:46:05,878 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2021-06-05 21:46:06,015 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-06-05 21:46:06,317 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2021-06-05 21:46:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:06,393 INFO L93 Difference]: Finished difference Result 630 states and 1888 transitions. [2021-06-05 21:46:06,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 21:46:06,393 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:06,394 INFO L225 Difference]: With dead ends: 630 [2021-06-05 21:46:06,394 INFO L226 Difference]: Without dead ends: 613 [2021-06-05 21:46:06,394 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3695.0ms TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 21:46:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-06-05 21:46:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 366. [2021-06-05 21:46:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.2) internal successors, (1168), 365 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1168 transitions. [2021-06-05 21:46:06,399 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1168 transitions. Word has length 17 [2021-06-05 21:46:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:06,399 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1168 transitions. [2021-06-05 21:46:06,399 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1168 transitions. [2021-06-05 21:46:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:06,400 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:06,400 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:06,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1457,201 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:06,600 INFO L430 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash -99613656, now seen corresponding path program 55 times [2021-06-05 21:46:06,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:06,600 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240195801] [2021-06-05 21:46:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:06,960 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2021-06-05 21:46:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:07,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:07,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240195801] [2021-06-05 21:46:07,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240195801] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:07,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572319888] [2021-06-05 21:46:07,049 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:07,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:07,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:07,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,224 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:07,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,228 INFO L388 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 11 [2021-06-05 21:46:07,229 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:07,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,266 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:07,266 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,269 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:07,270 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:07,301 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:07,302 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:105 [2021-06-05 21:46:07,474 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_407, v_prenex_409, array_2, v_prenex_411], 1=[v_prenex_406, array_0, v_prenex_408, v_prenex_410]} [2021-06-05 21:46:07,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:46:07,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:46:07,484 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,565 INFO L628 ElimStorePlain]: treesize reduction 116, result has 46.3 percent of original size [2021-06-05 21:46:07,565 INFO L518 ElimStorePlain]: Eliminatee v_prenex_409 vanished before elimination [2021-06-05 21:46:07,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:07,569 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:07,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:07,596 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,619 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:07,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,622 INFO L388 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 [2021-06-05 21:46:07,624 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:07,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:07,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,648 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:07,648 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:07,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:07,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_408 vanished before elimination [2021-06-05 21:46:07,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:07,672 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:07,673 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:07,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:07,695 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:07,695 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 21:46:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:07,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572319888] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:07,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:07,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:46:07,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500009551] [2021-06-05 21:46:07,741 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:07,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:07,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:07,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:07,742 INFO L87 Difference]: Start difference. First operand 366 states and 1168 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:08,291 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2021-06-05 21:46:08,685 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2021-06-05 21:46:09,005 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 112 [2021-06-05 21:46:09,259 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2021-06-05 21:46:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:09,337 INFO L93 Difference]: Finished difference Result 600 states and 1826 transitions. [2021-06-05 21:46:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:46:09,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:09,338 INFO L225 Difference]: With dead ends: 600 [2021-06-05 21:46:09,338 INFO L226 Difference]: Without dead ends: 582 [2021-06-05 21:46:09,338 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1675.1ms TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:46:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-06-05 21:46:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 375. [2021-06-05 21:46:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 3.2085561497326203) internal successors, (1200), 374 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1200 transitions. [2021-06-05 21:46:09,343 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1200 transitions. Word has length 17 [2021-06-05 21:46:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:09,343 INFO L482 AbstractCegarLoop]: Abstraction has 375 states and 1200 transitions. [2021-06-05 21:46:09,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1200 transitions. [2021-06-05 21:46:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:09,344 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:09,344 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:09,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 202 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1484 [2021-06-05 21:46:09,544 INFO L430 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:09,544 INFO L82 PathProgramCache]: Analyzing trace with hash 61528026, now seen corresponding path program 56 times [2021-06-05 21:46:09,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:09,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225101041] [2021-06-05 21:46:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:09,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:09,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225101041] [2021-06-05 21:46:09,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225101041] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:09,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227447960] [2021-06-05 21:46:09,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:09,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:46:09,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:09,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:09,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:10,066 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_413], 3=[array_0]} [2021-06-05 21:46:10,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,070 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:10,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,074 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:10,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:10,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,115 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:10,116 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,119 INFO L388 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 11 [2021-06-05 21:46:10,120 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:10,154 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:10,155 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:149, output treesize:115 [2021-06-05 21:46:10,302 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_416, v_prenex_418, array_2, v_prenex_420], 1=[v_prenex_417, v_prenex_419, array_4, v_prenex_421]} [2021-06-05 21:46:10,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:46:10,307 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:10,312 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,409 INFO L628 ElimStorePlain]: treesize reduction 85, result has 65.0 percent of original size [2021-06-05 21:46:10,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:10,414 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:10,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:10,457 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,494 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:10,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:46:10,498 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:46:10,502 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:10,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,538 INFO L388 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 [2021-06-05 21:46:10,539 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:10,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:10,572 INFO L518 ElimStorePlain]: Eliminatee v_prenex_419 vanished before elimination [2021-06-05 21:46:10,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,575 INFO L388 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 13 treesize of output 9 [2021-06-05 21:46:10,577 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:10,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:10,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,613 INFO L388 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 [2021-06-05 21:46:10,614 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:10,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:10,617 INFO L388 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 25 treesize of output 17 [2021-06-05 21:46:10,618 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:10,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:10,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:10,651 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:257, output treesize:48 [2021-06-05 21:46:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:10,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227447960] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:10,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:10,704 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:46:10,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248745007] [2021-06-05 21:46:10,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:10,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:10,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:10,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:10,704 INFO L87 Difference]: Start difference. First operand 375 states and 1200 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:11,212 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 21:46:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:11,303 INFO L93 Difference]: Finished difference Result 435 states and 1364 transitions. [2021-06-05 21:46:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:46:11,303 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:11,304 INFO L225 Difference]: With dead ends: 435 [2021-06-05 21:46:11,304 INFO L226 Difference]: Without dead ends: 425 [2021-06-05 21:46:11,304 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 846.1ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:46:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-06-05 21:46:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 378. [2021-06-05 21:46:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 21:46:11,308 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 21:46:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:11,308 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 21:46:11,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 21:46:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:11,308 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:11,308 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:11,509 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1509,203 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:11,509 INFO L430 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1542765896, now seen corresponding path program 57 times [2021-06-05 21:46:11,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:11,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51708415] [2021-06-05 21:46:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:11,683 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:11,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51708415] [2021-06-05 21:46:11,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51708415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:11,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439590913] [2021-06-05 21:46:11,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:11,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:46:11,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:11,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:11,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:11,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:11,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:11,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:11,811 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:11,841 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:11,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:11,844 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:11,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:11,847 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:11,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:11,874 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:11,874 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:90 [2021-06-05 21:46:11,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:11,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:11,973 INFO L388 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 18 treesize of output 14 [2021-06-05 21:46:11,974 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:11,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:11,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:11,978 INFO L388 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 17 treesize of output 13 [2021-06-05 21:46:11,979 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:11,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:11,982 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:11,983 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:12,050 INFO L628 ElimStorePlain]: treesize reduction 121, result has 45.0 percent of original size [2021-06-05 21:46:12,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:12,053 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:12,054 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:12,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:12,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:12,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:12,087 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:12,088 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:12,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:12,090 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:12,091 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:12,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:12,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:12,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:12,117 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:12,118 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:12,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:12,121 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:12,121 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:12,143 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:12,144 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:12,144 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:245, output treesize:38 [2021-06-05 21:46:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:12,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439590913] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:12,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:12,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:46:12,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933506301] [2021-06-05 21:46:12,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:46:12,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:12,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:46:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:46:12,184 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:12,827 INFO L93 Difference]: Finished difference Result 433 states and 1360 transitions. [2021-06-05 21:46:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:46:12,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:12,828 INFO L225 Difference]: With dead ends: 433 [2021-06-05 21:46:12,828 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 21:46:12,828 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 690.9ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:46:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 21:46:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 377. [2021-06-05 21:46:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.2074468085106385) internal successors, (1206), 376 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1206 transitions. [2021-06-05 21:46:12,832 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1206 transitions. Word has length 17 [2021-06-05 21:46:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:12,832 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1206 transitions. [2021-06-05 21:46:12,832 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1206 transitions. [2021-06-05 21:46:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:12,833 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:12,833 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:13,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1538,204 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:13,033 INFO L430 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2091682306, now seen corresponding path program 58 times [2021-06-05 21:46:13,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:13,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369277099] [2021-06-05 21:46:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:13,382 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 21:46:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:13,586 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:13,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369277099] [2021-06-05 21:46:13,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369277099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:13,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73547243] [2021-06-05 21:46:13,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:13,613 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:46:13,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:13,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:13,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:13,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:13,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:13,720 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:13,722 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:13,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:13,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:13,725 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:13,726 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:13,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:13,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:13,730 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:13,731 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:13,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:13,734 INFO L388 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 11 [2021-06-05 21:46:13,735 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:13,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:13,788 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:13,788 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:157 [2021-06-05 21:46:14,048 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2021-06-05 21:46:14,169 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_438, array_2, v_prenex_440, v_prenex_442, v_prenex_434, v_prenex_436], 1=[v_prenex_437, v_prenex_439, array_4, v_prenex_441, v_prenex_443, v_prenex_435]} [2021-06-05 21:46:14,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:46:14,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:14,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:46:14,183 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:14,341 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2021-06-05 21:46:14,341 INFO L628 ElimStorePlain]: treesize reduction 187, result has 51.3 percent of original size [2021-06-05 21:46:14,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:14,347 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:14,400 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:14,405 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:14,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:14,462 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:14,512 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:14,517 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:14,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:14,571 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:14,618 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:14,622 INFO L388 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 21 treesize of output 13 [2021-06-05 21:46:14,623 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:14,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:14,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:14,673 INFO L388 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 [2021-06-05 21:46:14,675 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:14,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:14,679 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:14,680 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:14,726 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:14,730 INFO L388 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 [2021-06-05 21:46:14,731 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:14,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,777 INFO L518 ElimStorePlain]: Eliminatee v_prenex_441 vanished before elimination [2021-06-05 21:46:14,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:14,780 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:14,782 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:14,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:14,825 INFO L518 ElimStorePlain]: Eliminatee v_prenex_435 vanished before elimination [2021-06-05 21:46:14,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 21:46:14,828 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:411, output treesize:77 [2021-06-05 21:46:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:14,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73547243] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:14,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:14,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:46:14,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443704541] [2021-06-05 21:46:14,890 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:46:14,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:14,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:46:14,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:46:14,890 INFO L87 Difference]: Start difference. First operand 377 states and 1206 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:15,394 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-06-05 21:46:15,605 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2021-06-05 21:46:15,934 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 123 [2021-06-05 21:46:16,255 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 116 [2021-06-05 21:46:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:16,358 INFO L93 Difference]: Finished difference Result 436 states and 1366 transitions. [2021-06-05 21:46:16,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:46:16,358 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:16,359 INFO L225 Difference]: With dead ends: 436 [2021-06-05 21:46:16,359 INFO L226 Difference]: Without dead ends: 426 [2021-06-05 21:46:16,359 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1921.4ms TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:46:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-06-05 21:46:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 379. [2021-06-05 21:46:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2063492063492065) internal successors, (1212), 378 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1212 transitions. [2021-06-05 21:46:16,363 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1212 transitions. Word has length 17 [2021-06-05 21:46:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:16,363 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1212 transitions. [2021-06-05 21:46:16,363 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1212 transitions. [2021-06-05 21:46:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:16,363 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:16,364 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:16,564 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1550,205 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:16,564 INFO L430 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1276876152, now seen corresponding path program 59 times [2021-06-05 21:46:16,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:16,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704806218] [2021-06-05 21:46:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:17,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:17,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704806218] [2021-06-05 21:46:17,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704806218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:17,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996955266] [2021-06-05 21:46:17,039 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:17,066 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:46:17,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:17,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:17,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:17,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,210 INFO L388 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 11 [2021-06-05 21:46:17,211 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:17,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,215 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:17,215 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:17,255 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:17,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,259 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:17,260 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:17,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,264 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:17,265 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:17,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:17,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:17,302 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 21:46:17,414 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_450, v_prenex_452, v_prenex_454], 1=[v_prenex_449, array_0, v_prenex_451, v_prenex_453]} [2021-06-05 21:46:17,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:17,420 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:17,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:46:17,425 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:17,507 INFO L628 ElimStorePlain]: treesize reduction 113, result has 45.9 percent of original size [2021-06-05 21:46:17,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:17,511 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:17,536 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:17,536 INFO L518 ElimStorePlain]: Eliminatee v_prenex_452 vanished before elimination [2021-06-05 21:46:17,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:17,540 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:17,562 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:17,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,566 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:17,568 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:17,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:17,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,593 INFO L388 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 [2021-06-05 21:46:17,594 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:17,616 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:17,616 INFO L518 ElimStorePlain]: Eliminatee v_prenex_451 vanished before elimination [2021-06-05 21:46:17,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:17,619 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:17,621 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:17,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:17,643 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:17,643 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:223, output treesize:38 [2021-06-05 21:46:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:17,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996955266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:17,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:17,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:46:17,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144580528] [2021-06-05 21:46:17,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:17,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:17,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:17,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:17,686 INFO L87 Difference]: Start difference. First operand 379 states and 1212 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:18,188 INFO L93 Difference]: Finished difference Result 429 states and 1350 transitions. [2021-06-05 21:46:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:46:18,188 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:18,189 INFO L225 Difference]: With dead ends: 429 [2021-06-05 21:46:18,189 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 21:46:18,189 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 832.8ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:46:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 21:46:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 378. [2021-06-05 21:46:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 21:46:18,193 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 21:46:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:18,193 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 21:46:18,193 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 21:46:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:18,194 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:18,194 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:18,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1581,206 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:18,394 INFO L430 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:18,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1996192008, now seen corresponding path program 60 times [2021-06-05 21:46:18,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:18,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721290428] [2021-06-05 21:46:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:18,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:18,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721290428] [2021-06-05 21:46:18,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721290428] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:18,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065458012] [2021-06-05 21:46:18,754 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:18,782 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:46:18,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:18,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:18,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:18,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:18,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:18,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:18,882 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:18,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:18,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:18,929 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:18,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:18,933 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:18,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:18,972 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:18,972 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:92 [2021-06-05 21:46:19,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,094 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:19,095 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:19,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,099 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:19,100 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:19,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,104 INFO L388 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 38 treesize of output 30 [2021-06-05 21:46:19,105 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:19,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,109 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:19,110 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:19,173 INFO L628 ElimStorePlain]: treesize reduction 122, result has 44.0 percent of original size [2021-06-05 21:46:19,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,177 INFO L388 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 [2021-06-05 21:46:19,179 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:19,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,182 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:19,182 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:19,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:19,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,209 INFO L388 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 28 treesize of output 22 [2021-06-05 21:46:19,210 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:19,232 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:19,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:19,235 INFO L388 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 21 treesize of output 13 [2021-06-05 21:46:19,236 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:19,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:19,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:19,260 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:249, output treesize:38 [2021-06-05 21:46:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:19,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065458012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:19,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:19,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:46:19,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156049048] [2021-06-05 21:46:19,299 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:46:19,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:19,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:46:19,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:46:19,300 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:19,728 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-06-05 21:46:19,886 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2021-06-05 21:46:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:19,967 INFO L93 Difference]: Finished difference Result 432 states and 1360 transitions. [2021-06-05 21:46:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:46:19,967 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:19,968 INFO L225 Difference]: With dead ends: 432 [2021-06-05 21:46:19,968 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 21:46:19,968 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 874.2ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:46:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 21:46:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-06-05 21:46:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.20844327176781) internal successors, (1216), 379 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1216 transitions. [2021-06-05 21:46:19,972 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1216 transitions. Word has length 17 [2021-06-05 21:46:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:19,972 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1216 transitions. [2021-06-05 21:46:19,972 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1216 transitions. [2021-06-05 21:46:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:19,973 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:19,973 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:20,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 207 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1606 [2021-06-05 21:46:20,173 INFO L430 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:20,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:20,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1653608496, now seen corresponding path program 61 times [2021-06-05 21:46:20,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:20,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932698266] [2021-06-05 21:46:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:20,463 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:20,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932698266] [2021-06-05 21:46:20,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932698266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:20,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711099565] [2021-06-05 21:46:20,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:20,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:20,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:20,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:20,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:20,657 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:20,658 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:20,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:20,662 INFO L388 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 11 [2021-06-05 21:46:20,663 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:20,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:20,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:20,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:20,709 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:20,710 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:20,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:20,713 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:20,714 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:20,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:20,749 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:20,749 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:109 [2021-06-05 21:46:20,866 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_464, v_prenex_466, v_prenex_468], 1=[array_0, v_prenex_463, v_prenex_465, v_prenex_467]} [2021-06-05 21:46:20,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:20,873 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:20,948 INFO L628 ElimStorePlain]: treesize reduction 115, result has 48.7 percent of original size [2021-06-05 21:46:20,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:20,960 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:20,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:20,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:20,989 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:21,013 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:21,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:46:21,016 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:21,038 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:21,038 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:46:21,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:21,041 INFO L388 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 [2021-06-05 21:46:21,042 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:21,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:21,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:21,072 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:21,073 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:21,094 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:21,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:21,097 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:21,097 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:21,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:21,119 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:21,119 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 21:46:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:21,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711099565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:21,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:21,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:46:21,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986738680] [2021-06-05 21:46:21,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:46:21,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:46:21,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:46:21,162 INFO L87 Difference]: Start difference. First operand 380 states and 1216 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:21,697 INFO L93 Difference]: Finished difference Result 430 states and 1354 transitions. [2021-06-05 21:46:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:46:21,698 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:21,698 INFO L225 Difference]: With dead ends: 430 [2021-06-05 21:46:21,698 INFO L226 Difference]: Without dead ends: 419 [2021-06-05 21:46:21,698 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 712.1ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:46:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-06-05 21:46:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 378. [2021-06-05 21:46:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 21:46:21,702 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 21:46:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:21,702 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 21:46:21,703 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 21:46:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:21,703 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:21,703 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:21,903 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1618,208 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:21,904 INFO L430 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1205884026, now seen corresponding path program 62 times [2021-06-05 21:46:21,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:21,904 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579445524] [2021-06-05 21:46:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:22,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:22,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579445524] [2021-06-05 21:46:22,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579445524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:22,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900210123] [2021-06-05 21:46:22,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:22,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:46:22,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:22,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:22,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:22,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:22,447 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:22,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:22,450 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:22,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:22,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:22,478 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:22,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:22,481 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:22,501 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:22,502 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:22,502 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2021-06-05 21:46:22,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:22,568 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:22,603 INFO L628 ElimStorePlain]: treesize reduction 52, result has 56.7 percent of original size [2021-06-05 21:46:22,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:22,606 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:22,619 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:22,619 INFO L518 ElimStorePlain]: Eliminatee v_prenex_471 vanished before elimination [2021-06-05 21:46:22,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:46:22,622 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:22,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:22,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:46:22,636 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:22,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:22,647 INFO L518 ElimStorePlain]: Eliminatee v_prenex_473 vanished before elimination [2021-06-05 21:46:22,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:22,648 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 21:46:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:22,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900210123] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:22,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:22,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:46:22,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229893392] [2021-06-05 21:46:22,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:46:22,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:46:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:46:22,683 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:23,176 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2021-06-05 21:46:23,356 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2021-06-05 21:46:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:23,441 INFO L93 Difference]: Finished difference Result 456 states and 1422 transitions. [2021-06-05 21:46:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:46:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:23,442 INFO L225 Difference]: With dead ends: 456 [2021-06-05 21:46:23,442 INFO L226 Difference]: Without dead ends: 444 [2021-06-05 21:46:23,442 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 957.1ms TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:46:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-06-05 21:46:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 382. [2021-06-05 21:46:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.2073490813648293) internal successors, (1222), 381 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1222 transitions. [2021-06-05 21:46:23,450 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1222 transitions. Word has length 17 [2021-06-05 21:46:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:23,450 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1222 transitions. [2021-06-05 21:46:23,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1222 transitions. [2021-06-05 21:46:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:23,451 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:23,451 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:23,651 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 209 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1651 [2021-06-05 21:46:23,651 INFO L430 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash 391077872, now seen corresponding path program 63 times [2021-06-05 21:46:23,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:23,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864776606] [2021-06-05 21:46:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:23,954 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:23,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864776606] [2021-06-05 21:46:23,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864776606] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:23,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686273730] [2021-06-05 21:46:23,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:23,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:46:23,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:23,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:23,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:24,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,145 INFO L388 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 11 [2021-06-05 21:46:24,146 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,150 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:24,151 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:24,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,207 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:24,208 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,211 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:24,212 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,259 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:24,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:24,263 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:158 [2021-06-05 21:46:24,386 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 21:46:24,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,391 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:24,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,396 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,396 INFO L388 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 29 treesize of output 23 [2021-06-05 21:46:24,397 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,408 INFO L388 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 11 [2021-06-05 21:46:24,409 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,414 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:24,415 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,419 INFO L388 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 39 treesize of output 31 [2021-06-05 21:46:24,420 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,425 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:24,425 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,430 INFO L388 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 17 treesize of output 13 [2021-06-05 21:46:24,431 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,435 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:24,436 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,587 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2021-06-05 21:46:24,587 INFO L628 ElimStorePlain]: treesize reduction 158, result has 53.9 percent of original size [2021-06-05 21:46:24,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,592 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:24,593 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,597 INFO L388 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 [2021-06-05 21:46:24,598 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:24,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,602 INFO L388 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 25 treesize of output 17 [2021-06-05 21:46:24,603 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:24,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:24,607 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:24,608 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:24,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:24,667 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:24,667 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:403, output treesize:101 [2021-06-05 21:46:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:24,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686273730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:24,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:24,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:46:24,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377448488] [2021-06-05 21:46:24,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:46:24,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:46:24,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:46:24,797 INFO L87 Difference]: Start difference. First operand 382 states and 1222 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:25,424 INFO L93 Difference]: Finished difference Result 456 states and 1426 transitions. [2021-06-05 21:46:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:46:25,424 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:25,425 INFO L225 Difference]: With dead ends: 456 [2021-06-05 21:46:25,425 INFO L226 Difference]: Without dead ends: 443 [2021-06-05 21:46:25,425 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 862.5ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:46:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-06-05 21:46:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 380. [2021-06-05 21:46:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.20844327176781) internal successors, (1216), 379 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1216 transitions. [2021-06-05 21:46:25,429 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1216 transitions. Word has length 17 [2021-06-05 21:46:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:25,429 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1216 transitions. [2021-06-05 21:46:25,429 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1216 transitions. [2021-06-05 21:46:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:25,430 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:25,430 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:25,630 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 210 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1660 [2021-06-05 21:46:25,631 INFO L430 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:25,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:25,631 INFO L82 PathProgramCache]: Analyzing trace with hash 981448970, now seen corresponding path program 64 times [2021-06-05 21:46:25,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:25,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052788481] [2021-06-05 21:46:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:25,904 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:25,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052788481] [2021-06-05 21:46:25,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052788481] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:25,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933218306] [2021-06-05 21:46:25,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:25,932 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:46:25,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:25,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:25,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:26,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,074 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:26,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,079 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:26,080 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:26,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,124 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:26,125 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,128 INFO L388 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 11 [2021-06-05 21:46:26,129 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:26,167 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:26,168 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:160, output treesize:122 [2021-06-05 21:46:26,355 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 21:46:26,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,360 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:26,361 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,366 INFO L388 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 29 treesize of output 23 [2021-06-05 21:46:26,366 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,371 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:26,372 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,376 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:26,377 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,382 INFO L388 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 17 treesize of output 13 [2021-06-05 21:46:26,383 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,387 INFO L388 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 39 treesize of output 31 [2021-06-05 21:46:26,388 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,393 INFO L388 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 17 treesize of output 13 [2021-06-05 21:46:26,394 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,398 INFO L388 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 11 [2021-06-05 21:46:26,399 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,551 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2021-06-05 21:46:26,551 INFO L628 ElimStorePlain]: treesize reduction 142, result has 56.6 percent of original size [2021-06-05 21:46:26,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,578 INFO L388 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 25 treesize of output 17 [2021-06-05 21:46:26,579 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,584 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:26,585 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:26,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,590 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:26,591 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:26,594 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:26,594 INFO L388 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 [2021-06-05 21:46:26,595 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:26,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:26,653 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:26,653 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:395, output treesize:101 [2021-06-05 21:46:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:26,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933218306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:26,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:26,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:46:26,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771288979] [2021-06-05 21:46:26,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:26,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:26,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:26,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:26,778 INFO L87 Difference]: Start difference. First operand 380 states and 1216 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:27,428 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2021-06-05 21:46:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:27,612 INFO L93 Difference]: Finished difference Result 508 states and 1579 transitions. [2021-06-05 21:46:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:46:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:27,613 INFO L225 Difference]: With dead ends: 508 [2021-06-05 21:46:27,613 INFO L226 Difference]: Without dead ends: 494 [2021-06-05 21:46:27,613 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1032.0ms TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:46:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-06-05 21:46:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 379. [2021-06-05 21:46:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2116402116402116) internal successors, (1214), 378 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1214 transitions. [2021-06-05 21:46:27,618 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1214 transitions. Word has length 17 [2021-06-05 21:46:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:27,618 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1214 transitions. [2021-06-05 21:46:27,618 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1214 transitions. [2021-06-05 21:46:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:27,618 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:27,618 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:27,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1678,211 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:27,819 INFO L430 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 527178728, now seen corresponding path program 65 times [2021-06-05 21:46:27,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:27,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520681086] [2021-06-05 21:46:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:28,176 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:28,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520681086] [2021-06-05 21:46:28,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520681086] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:28,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883770347] [2021-06-05 21:46:28,177 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:28,204 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:46:28,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:28,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:28,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:28,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:28,301 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:28,304 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:28,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:28,337 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:28,340 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,366 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:28,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:28,367 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:90 [2021-06-05 21:46:28,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,467 INFO L388 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 18 treesize of output 14 [2021-06-05 21:46:28,468 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,472 INFO L388 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 17 treesize of output 13 [2021-06-05 21:46:28,473 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,477 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:28,477 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,545 INFO L628 ElimStorePlain]: treesize reduction 125, result has 43.2 percent of original size [2021-06-05 21:46:28,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,548 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:28,549 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:28,576 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:28,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,580 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:28,580 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,583 INFO L388 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 19 treesize of output 15 [2021-06-05 21:46:28,584 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,607 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:28,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,610 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:28,611 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:28,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:28,613 INFO L388 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 [2021-06-05 21:46:28,615 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:28,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:28,638 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:28,638 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:245, output treesize:38 [2021-06-05 21:46:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:28,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883770347] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:28,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:28,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:46:28,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456777427] [2021-06-05 21:46:28,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:46:28,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:46:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:46:28,679 INFO L87 Difference]: Start difference. First operand 379 states and 1214 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:29,238 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2021-06-05 21:46:29,530 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2021-06-05 21:46:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:29,610 INFO L93 Difference]: Finished difference Result 451 states and 1418 transitions. [2021-06-05 21:46:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:46:29,610 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:29,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:29,611 INFO L225 Difference]: With dead ends: 451 [2021-06-05 21:46:29,611 INFO L226 Difference]: Without dead ends: 441 [2021-06-05 21:46:29,611 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1110.7ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:46:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-06-05 21:46:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 383. [2021-06-05 21:46:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.2094240837696337) internal successors, (1226), 382 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1226 transitions. [2021-06-05 21:46:29,615 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1226 transitions. Word has length 17 [2021-06-05 21:46:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:29,615 INFO L482 AbstractCegarLoop]: Abstraction has 383 states and 1226 transitions. [2021-06-05 21:46:29,615 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1226 transitions. [2021-06-05 21:46:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:29,616 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:29,616 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:29,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1702,212 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:29,816 INFO L430 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:29,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash 869762240, now seen corresponding path program 66 times [2021-06-05 21:46:29,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:29,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044571793] [2021-06-05 21:46:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:30,126 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:30,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044571793] [2021-06-05 21:46:30,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044571793] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:30,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441637833] [2021-06-05 21:46:30,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:30,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 21:46:30,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:30,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:30,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:30,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,292 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:30,292 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,303 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:30,304 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,309 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:30,310 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,314 INFO L388 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 11 [2021-06-05 21:46:30,315 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:30,387 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:30,388 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:163 [2021-06-05 21:46:30,527 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_490, array_2, v_prenex_492, v_prenex_488], 1=[array_0, v_prenex_491, v_prenex_487, v_prenex_489]} [2021-06-05 21:46:30,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:30,534 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:30,540 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,738 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2021-06-05 21:46:30,738 INFO L628 ElimStorePlain]: treesize reduction 153, result has 57.1 percent of original size [2021-06-05 21:46:30,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:30,742 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:30,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:30,808 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:30,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:46:30,873 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 21:46:30,877 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:30,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,940 INFO L388 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 21 treesize of output 13 [2021-06-05 21:46:30,941 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:30,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:30,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:30,999 INFO L388 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 [2021-06-05 21:46:31,000 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:31,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:31,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:31,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:31,057 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:31,058 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:31,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:31,061 INFO L388 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 25 treesize of output 17 [2021-06-05 21:46:31,062 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:31,112 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:31,112 INFO L518 ElimStorePlain]: Eliminatee v_prenex_489 vanished before elimination [2021-06-05 21:46:31,113 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:31,113 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:375, output treesize:122 [2021-06-05 21:46:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:31,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441637833] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:31,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:31,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:46:31,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799713750] [2021-06-05 21:46:31,269 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:31,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:31,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:31,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:31,269 INFO L87 Difference]: Start difference. First operand 383 states and 1226 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:31,818 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2021-06-05 21:46:31,985 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2021-06-05 21:46:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:32,068 INFO L93 Difference]: Finished difference Result 449 states and 1412 transitions. [2021-06-05 21:46:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:46:32,069 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:32,070 INFO L225 Difference]: With dead ends: 449 [2021-06-05 21:46:32,070 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 21:46:32,070 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1078.5ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:46:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 21:46:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 381. [2021-06-05 21:46:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.210526315789474) internal successors, (1220), 380 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1220 transitions. [2021-06-05 21:46:32,074 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1220 transitions. Word has length 17 [2021-06-05 21:46:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:32,074 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1220 transitions. [2021-06-05 21:46:32,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1220 transitions. [2021-06-05 21:46:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:32,074 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:32,074 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:32,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1715,213 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:32,275 INFO L430 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1237021880, now seen corresponding path program 67 times [2021-06-05 21:46:32,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:32,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719301677] [2021-06-05 21:46:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:32,544 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:32,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719301677] [2021-06-05 21:46:32,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719301677] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:32,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169418642] [2021-06-05 21:46:32,545 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:32,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:32,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:32,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:32,684 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:32,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:32,688 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:32,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:32,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:32,724 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:32,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:32,727 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:32,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:32,755 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:32,755 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:99 [2021-06-05 21:46:32,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:32,916 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:32,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:32,990 INFO L628 ElimStorePlain]: treesize reduction 117, result has 47.8 percent of original size [2021-06-05 21:46:32,990 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:46:32,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:32,994 INFO L388 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 19 treesize of output 15 [2021-06-05 21:46:32,994 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:33,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:33,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:33,023 INFO L388 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 [2021-06-05 21:46:33,025 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:33,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:33,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:33,053 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:33,054 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:33,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:33,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:33,082 INFO L388 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 [2021-06-05 21:46:33,083 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:33,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:33,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:33,109 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:33,110 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:33,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:33,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:33,135 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:33,136 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:33,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:33,159 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:33,159 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 21:46:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:33,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169418642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:33,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:33,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 21:46:33,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135354687] [2021-06-05 21:46:33,202 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:46:33,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:33,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:46:33,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:46:33,202 INFO L87 Difference]: Start difference. First operand 381 states and 1220 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:33,778 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2021-06-05 21:46:33,933 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2021-06-05 21:46:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:34,131 INFO L93 Difference]: Finished difference Result 487 states and 1515 transitions. [2021-06-05 21:46:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:46:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:34,132 INFO L225 Difference]: With dead ends: 487 [2021-06-05 21:46:34,132 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 21:46:34,132 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1022.7ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:46:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 21:46:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 381. [2021-06-05 21:46:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.210526315789474) internal successors, (1220), 380 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1220 transitions. [2021-06-05 21:46:34,136 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1220 transitions. Word has length 17 [2021-06-05 21:46:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:34,136 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1220 transitions. [2021-06-05 21:46:34,136 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1220 transitions. [2021-06-05 21:46:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:34,136 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:34,137 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:34,337 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1735,214 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:34,337 INFO L430 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash -176185004, now seen corresponding path program 68 times [2021-06-05 21:46:34,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:34,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74251965] [2021-06-05 21:46:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:34,601 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:34,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74251965] [2021-06-05 21:46:34,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74251965] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:34,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996233686] [2021-06-05 21:46:34,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:34,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:46:34,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:34,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:34,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:34,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:34,738 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:34,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:34,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:34,742 INFO L388 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 11 [2021-06-05 21:46:34,743 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:34,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:34,747 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:34,747 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:34,751 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:34,752 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:34,808 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:34,809 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:34,809 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:163 [2021-06-05 21:46:35,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,106 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:35,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:35,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,112 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:35,113 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:35,239 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2021-06-05 21:46:35,240 INFO L628 ElimStorePlain]: treesize reduction 167, result has 48.5 percent of original size [2021-06-05 21:46:35,240 INFO L518 ElimStorePlain]: Eliminatee v_prenex_504 vanished before elimination [2021-06-05 21:46:35,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,244 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:35,244 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:35,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:35,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,294 INFO L388 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 21 treesize of output 13 [2021-06-05 21:46:35,294 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:35,339 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:35,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,342 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:35,343 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:35,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:35,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,389 INFO L388 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 21 treesize of output 17 [2021-06-05 21:46:35,390 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:35,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,393 INFO L388 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 19 treesize of output 15 [2021-06-05 21:46:35,394 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:35,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:35,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,434 INFO L388 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 [2021-06-05 21:46:35,436 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:35,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:35,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,477 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:35,478 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:35,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:35,481 INFO L388 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 14 treesize of output 10 [2021-06-05 21:46:35,483 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:35,518 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:35,520 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:46:35,520 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:338, output treesize:67 [2021-06-05 21:46:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:35,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996233686] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:35,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:35,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:46:35,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909133170] [2021-06-05 21:46:35,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:46:35,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:35,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:46:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:46:35,579 INFO L87 Difference]: Start difference. First operand 381 states and 1220 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:36,365 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-06-05 21:46:36,716 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2021-06-05 21:46:36,920 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2021-06-05 21:46:37,263 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2021-06-05 21:46:37,676 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2021-06-05 21:46:38,041 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2021-06-05 21:46:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:38,101 INFO L93 Difference]: Finished difference Result 476 states and 1470 transitions. [2021-06-05 21:46:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 21:46:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:38,102 INFO L225 Difference]: With dead ends: 476 [2021-06-05 21:46:38,102 INFO L226 Difference]: Without dead ends: 464 [2021-06-05 21:46:38,102 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2707.0ms TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2021-06-05 21:46:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-06-05 21:46:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2021-06-05 21:46:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.1984334203655354) internal successors, (1225), 383 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1225 transitions. [2021-06-05 21:46:38,107 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1225 transitions. Word has length 17 [2021-06-05 21:46:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:38,107 INFO L482 AbstractCegarLoop]: Abstraction has 384 states and 1225 transitions. [2021-06-05 21:46:38,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1225 transitions. [2021-06-05 21:46:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:38,107 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:38,107 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:38,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1765,215 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:38,308 INFO L430 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1305052866, now seen corresponding path program 69 times [2021-06-05 21:46:38,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:38,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300091277] [2021-06-05 21:46:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:38,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:38,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300091277] [2021-06-05 21:46:38,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300091277] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:38,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090002069] [2021-06-05 21:46:38,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:38,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:46:38,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:38,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:38,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:38,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:38,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:38,711 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:38,712 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:38,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:38,715 INFO L388 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 11 [2021-06-05 21:46:38,716 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:38,787 INFO L628 ElimStorePlain]: treesize reduction 8, result has 93.8 percent of original size [2021-06-05 21:46:38,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:38,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:38,791 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:38,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:38,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:38,794 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:38,795 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:38,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:38,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:38,828 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:104 [2021-06-05 21:46:38,942 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_516, array_0, v_prenex_518, v_prenex_520], 1=[v_prenex_517, v_prenex_519, array_4, v_prenex_521]} [2021-06-05 21:46:38,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:38,947 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:38,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:38,953 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:39,053 INFO L628 ElimStorePlain]: treesize reduction 81, result has 64.3 percent of original size [2021-06-05 21:46:39,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 21:46:39,058 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:39,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:46:39,062 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:39,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:39,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:39,101 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:39,135 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:39,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:39,139 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:39,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:39,171 INFO L518 ElimStorePlain]: Eliminatee v_prenex_517 vanished before elimination [2021-06-05 21:46:39,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:39,175 INFO L388 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 [2021-06-05 21:46:39,176 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:39,207 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:39,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:39,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:39,211 INFO L388 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 25 treesize of output 17 [2021-06-05 21:46:39,211 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:39,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:39,215 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:39,216 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:39,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:39,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:39,248 INFO L388 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 [2021-06-05 21:46:39,250 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:39,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:39,280 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:39,280 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:245, output treesize:48 [2021-06-05 21:46:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:39,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090002069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:39,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:39,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:46:39,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963294069] [2021-06-05 21:46:39,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:46:39,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:39,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:46:39,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:46:39,337 INFO L87 Difference]: Start difference. First operand 384 states and 1225 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:40,381 INFO L93 Difference]: Finished difference Result 475 states and 1475 transitions. [2021-06-05 21:46:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 21:46:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:40,382 INFO L225 Difference]: With dead ends: 475 [2021-06-05 21:46:40,382 INFO L226 Difference]: Without dead ends: 459 [2021-06-05 21:46:40,382 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1110.0ms TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:46:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-06-05 21:46:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 381. [2021-06-05 21:46:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.2) internal successors, (1216), 380 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1216 transitions. [2021-06-05 21:46:40,386 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1216 transitions. Word has length 17 [2021-06-05 21:46:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:40,386 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1216 transitions. [2021-06-05 21:46:40,386 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1216 transitions. [2021-06-05 21:46:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:40,386 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:40,386 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:40,587 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 216 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1808 [2021-06-05 21:46:40,587 INFO L430 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash 733598060, now seen corresponding path program 70 times [2021-06-05 21:46:40,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:40,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060787333] [2021-06-05 21:46:40,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:40,851 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:40,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060787333] [2021-06-05 21:46:40,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060787333] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:40,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056278032] [2021-06-05 21:46:40,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:40,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:46:40,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:40,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:40,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:41,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,070 INFO L388 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 11 [2021-06-05 21:46:41,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,074 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:41,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,144 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:41,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,148 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:41,149 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,153 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:41,153 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:41,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,220 INFO L388 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 11 [2021-06-05 21:46:41,220 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:41,224 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:41,224 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:41,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 21:46:41,284 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:239, output treesize:190 [2021-06-05 21:46:41,569 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_537, array_0, v_prenex_529, v_prenex_531, v_prenex_533, v_prenex_535], 1=[v_prenex_536, v_prenex_538, array_4, v_prenex_530, v_prenex_532, v_prenex_534]} [2021-06-05 21:46:41,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:46:41,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:41,588 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,755 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-06-05 21:46:41,756 INFO L628 ElimStorePlain]: treesize reduction 178, result has 55.4 percent of original size [2021-06-05 21:46:41,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:41,761 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:41,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:41,825 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:41,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:41,886 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:41,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 21:46:41,946 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:41,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:46:41,952 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:42,001 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:42,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:42,007 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:42,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:42,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_536 vanished before elimination [2021-06-05 21:46:42,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:42,059 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:42,060 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:42,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:42,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:42,112 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:42,113 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:42,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:42,161 INFO L518 ElimStorePlain]: Eliminatee v_prenex_530 vanished before elimination [2021-06-05 21:46:42,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:42,165 INFO L388 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 [2021-06-05 21:46:42,166 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:42,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:42,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:42,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:42,218 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:42,219 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:42,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:42,223 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:42,224 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:42,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:42,273 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:46:42,273 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:419, output treesize:67 [2021-06-05 21:46:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:42,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056278032] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:42,332 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:42,332 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:46:42,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822989836] [2021-06-05 21:46:42,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:42,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:42,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:42,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:42,333 INFO L87 Difference]: Start difference. First operand 381 states and 1216 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:42,916 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2021-06-05 21:46:43,320 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 134 [2021-06-05 21:46:43,518 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2021-06-05 21:46:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:43,591 INFO L93 Difference]: Finished difference Result 488 states and 1491 transitions. [2021-06-05 21:46:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:46:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:43,592 INFO L225 Difference]: With dead ends: 488 [2021-06-05 21:46:43,592 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 21:46:43,593 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1380.3ms TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:46:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 21:46:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 379. [2021-06-05 21:46:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2037037037037037) internal successors, (1211), 378 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1211 transitions. [2021-06-05 21:46:43,597 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1211 transitions. Word has length 17 [2021-06-05 21:46:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:43,597 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1211 transitions. [2021-06-05 21:46:43,597 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1211 transitions. [2021-06-05 21:46:43,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:43,597 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:43,597 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:43,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1838,217 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:43,798 INFO L430 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash -271217144, now seen corresponding path program 71 times [2021-06-05 21:46:43,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:43,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453865574] [2021-06-05 21:46:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:44,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:44,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453865574] [2021-06-05 21:46:44,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453865574] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:44,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753715483] [2021-06-05 21:46:44,173 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:44,203 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:46:44,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:44,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 21:46:44,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:44,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,316 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:44,317 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,320 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:44,321 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:44,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,361 INFO L388 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 11 [2021-06-05 21:46:44,362 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,365 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:44,366 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:44,400 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:44,400 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:112 [2021-06-05 21:46:44,604 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 21:46:44,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,608 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:44,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,613 INFO L388 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 28 treesize of output 22 [2021-06-05 21:46:44,614 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,619 INFO L388 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 17 treesize of output 13 [2021-06-05 21:46:44,619 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,624 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:44,625 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,629 INFO L388 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 11 [2021-06-05 21:46:44,630 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,634 INFO L388 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 18 treesize of output 14 [2021-06-05 21:46:44,635 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,639 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:44,640 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,644 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:44,644 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,809 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2021-06-05 21:46:44,809 INFO L628 ElimStorePlain]: treesize reduction 145, result has 58.7 percent of original size [2021-06-05 21:46:44,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,814 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:44,814 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,819 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:44,820 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:44,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,824 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:44,825 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:44,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:44,829 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:44,830 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:44,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:44,898 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:44,898 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:415, output treesize:128 [2021-06-05 21:46:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:45,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753715483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:45,089 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:45,089 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:46:45,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856040187] [2021-06-05 21:46:45,089 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:46:45,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:45,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:46:45,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:46:45,089 INFO L87 Difference]: Start difference. First operand 379 states and 1211 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:45,913 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2021-06-05 21:46:46,084 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2021-06-05 21:46:46,330 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2021-06-05 21:46:46,611 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2021-06-05 21:46:46,952 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 112 [2021-06-05 21:46:47,264 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2021-06-05 21:46:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:47,376 INFO L93 Difference]: Finished difference Result 587 states and 1781 transitions. [2021-06-05 21:46:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 21:46:47,376 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:47,377 INFO L225 Difference]: With dead ends: 587 [2021-06-05 21:46:47,377 INFO L226 Difference]: Without dead ends: 566 [2021-06-05 21:46:47,377 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2340.6ms TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:46:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-06-05 21:46:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 378. [2021-06-05 21:46:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2015915119363396) internal successors, (1207), 377 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1207 transitions. [2021-06-05 21:46:47,382 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1207 transitions. Word has length 17 [2021-06-05 21:46:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:47,382 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1207 transitions. [2021-06-05 21:46:47,382 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1207 transitions. [2021-06-05 21:46:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:47,383 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:47,383 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:47,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 218 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1882 [2021-06-05 21:46:47,584 INFO L430 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash 692518350, now seen corresponding path program 72 times [2021-06-05 21:46:47,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:47,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050835957] [2021-06-05 21:46:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:47,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:47,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050835957] [2021-06-05 21:46:47,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050835957] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:47,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215700300] [2021-06-05 21:46:47,955 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:47,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:46:47,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:47,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:47,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:48,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:48,096 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:48,100 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:48,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:48,133 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:48,136 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:48,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:48,162 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:93 [2021-06-05 21:46:48,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:48,337 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:48,338 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,414 INFO L628 ElimStorePlain]: treesize reduction 111, result has 48.6 percent of original size [2021-06-05 21:46:48,414 INFO L518 ElimStorePlain]: Eliminatee v_prenex_548 vanished before elimination [2021-06-05 21:46:48,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:48,417 INFO L388 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 29 treesize of output 23 [2021-06-05 21:46:48,418 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:48,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:48,450 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:48,451 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:48,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:48,480 INFO L388 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 19 treesize of output 15 [2021-06-05 21:46:48,481 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,504 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:48,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:48,507 INFO L388 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 13 treesize of output 9 [2021-06-05 21:46:48,509 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:48,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:48,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:48,535 INFO L388 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 19 treesize of output 15 [2021-06-05 21:46:48,535 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:48,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:48,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:48,559 INFO L388 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 [2021-06-05 21:46:48,561 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:48,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:48,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:48,583 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:227, output treesize:38 [2021-06-05 21:46:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:48,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215700300] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:48,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:48,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:46:48,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384330912] [2021-06-05 21:46:48,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:48,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:48,622 INFO L87 Difference]: Start difference. First operand 378 states and 1207 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:49,279 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2021-06-05 21:46:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:49,384 INFO L93 Difference]: Finished difference Result 445 states and 1384 transitions. [2021-06-05 21:46:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:46:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:49,385 INFO L225 Difference]: With dead ends: 445 [2021-06-05 21:46:49,385 INFO L226 Difference]: Without dead ends: 435 [2021-06-05 21:46:49,385 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 958.0ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:46:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-06-05 21:46:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 380. [2021-06-05 21:46:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.203166226912929) internal successors, (1214), 379 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1214 transitions. [2021-06-05 21:46:49,390 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1214 transitions. Word has length 17 [2021-06-05 21:46:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:49,390 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1214 transitions. [2021-06-05 21:46:49,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1214 transitions. [2021-06-05 21:46:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:49,390 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:49,390 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:49,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 219 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1908 [2021-06-05 21:46:49,591 INFO L430 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2121211076, now seen corresponding path program 73 times [2021-06-05 21:46:49,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:49,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121628087] [2021-06-05 21:46:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:49,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:49,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121628087] [2021-06-05 21:46:49,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121628087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:49,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996946883] [2021-06-05 21:46:49,790 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:49,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:49,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:50,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,054 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:50,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,059 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:50,060 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,063 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:50,064 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:50,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,141 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:50,141 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,145 INFO L388 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 11 [2021-06-05 21:46:50,146 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,149 INFO L388 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 11 [2021-06-05 21:46:50,150 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,269 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2021-06-05 21:46:50,269 INFO L628 ElimStorePlain]: treesize reduction 10, result has 94.5 percent of original size [2021-06-05 21:46:50,274 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 21:46:50,274 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:239, output treesize:172 [2021-06-05 21:46:50,449 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_559, array_0, v_prenex_561, v_prenex_563, v_prenex_565, v_prenex_567], 1=[array_4, v_prenex_560, v_prenex_562, v_prenex_564, v_prenex_566, v_prenex_568]} [2021-06-05 21:46:50,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:50,456 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:50,462 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,634 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 88 [2021-06-05 21:46:50,635 INFO L628 ElimStorePlain]: treesize reduction 185, result has 52.3 percent of original size [2021-06-05 21:46:50,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:50,640 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:50,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:50,707 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:50,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:50,772 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:50,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 21:46:50,834 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:46:50,838 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:50,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:50,894 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:50,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:50,944 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:46:50,944 INFO L518 ElimStorePlain]: Eliminatee v_prenex_560 vanished before elimination [2021-06-05 21:46:50,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:50,948 INFO L388 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 [2021-06-05 21:46:50,949 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:51,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:51,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:51,008 INFO L388 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 [2021-06-05 21:46:51,009 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:51,058 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:51,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:51,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:51,063 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:51,064 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:51,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:51,068 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:51,069 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:51,118 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:51,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:51,122 INFO L388 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 [2021-06-05 21:46:51,124 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:51,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:51,173 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 21:46:51,173 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:402, output treesize:75 [2021-06-05 21:46:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:51,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996946883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:51,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:51,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:46:51,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642180322] [2021-06-05 21:46:51,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:51,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:51,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:51,232 INFO L87 Difference]: Start difference. First operand 380 states and 1214 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:51,635 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2021-06-05 21:46:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:51,684 INFO L93 Difference]: Finished difference Result 418 states and 1305 transitions. [2021-06-05 21:46:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:46:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:51,685 INFO L225 Difference]: With dead ends: 418 [2021-06-05 21:46:51,685 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 21:46:51,686 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 665.7ms TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:46:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 21:46:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 380. [2021-06-05 21:46:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.203166226912929) internal successors, (1214), 379 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1214 transitions. [2021-06-05 21:46:51,690 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1214 transitions. Word has length 17 [2021-06-05 21:46:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:51,690 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1214 transitions. [2021-06-05 21:46:51,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1214 transitions. [2021-06-05 21:46:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:51,690 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:51,690 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:51,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 220 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1950 [2021-06-05 21:46:51,891 INFO L430 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash -352509152, now seen corresponding path program 74 times [2021-06-05 21:46:51,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:51,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722057565] [2021-06-05 21:46:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:52,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:52,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722057565] [2021-06-05 21:46:52,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722057565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:52,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129998006] [2021-06-05 21:46:52,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:52,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:46:52,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:52,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:52,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:52,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,421 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:52,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,425 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:52,426 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:52,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,464 INFO L388 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 11 [2021-06-05 21:46:52,465 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,468 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:52,468 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:52,502 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:52,502 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:108 [2021-06-05 21:46:52,646 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_573, v_prenex_575, v_prenex_577], 1=[array_4, v_prenex_574, v_prenex_576, v_prenex_578]} [2021-06-05 21:46:52,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:46:52,653 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:52,660 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,785 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2021-06-05 21:46:52,785 INFO L628 ElimStorePlain]: treesize reduction 85, result has 63.8 percent of original size [2021-06-05 21:46:52,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:52,791 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,840 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:52,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 21:46:52,846 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:46:52,852 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:52,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:46:52,902 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:52,943 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:46:52,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,948 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:52,949 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:52,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:52,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:52,995 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:52,996 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:53,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:53,001 INFO L388 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 21 treesize of output 13 [2021-06-05 21:46:53,002 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:53,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:53,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:53,046 INFO L388 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 [2021-06-05 21:46:53,047 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:53,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:53,081 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:53,082 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:253, output treesize:48 [2021-06-05 21:46:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:53,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129998006] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:53,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:53,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:46:53,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035003056] [2021-06-05 21:46:53,138 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:46:53,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:53,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:46:53,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:46:53,138 INFO L87 Difference]: Start difference. First operand 380 states and 1214 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:53,629 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2021-06-05 21:46:53,796 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2021-06-05 21:46:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:53,895 INFO L93 Difference]: Finished difference Result 450 states and 1397 transitions. [2021-06-05 21:46:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:46:53,895 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:53,896 INFO L225 Difference]: With dead ends: 450 [2021-06-05 21:46:53,896 INFO L226 Difference]: Without dead ends: 440 [2021-06-05 21:46:53,896 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 954.4ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:46:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-06-05 21:46:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 379. [2021-06-05 21:46:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.201058201058201) internal successors, (1210), 378 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1210 transitions. [2021-06-05 21:46:53,902 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1210 transitions. Word has length 17 [2021-06-05 21:46:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:53,902 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1210 transitions. [2021-06-05 21:46:53,902 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1210 transitions. [2021-06-05 21:46:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:53,903 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:53,903 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:54,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1999,221 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:54,117 INFO L430 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:54,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1572294666, now seen corresponding path program 75 times [2021-06-05 21:46:54,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:54,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111877374] [2021-06-05 21:46:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:54,425 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 21:46:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:54,635 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:54,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111877374] [2021-06-05 21:46:54,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111877374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:54,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025920123] [2021-06-05 21:46:54,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:54,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:46:54,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:54,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:54,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:54,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:54,762 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:54,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:54,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:54,767 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:54,767 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:54,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:54,771 INFO L388 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 11 [2021-06-05 21:46:54,772 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:54,774 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:54,775 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:54,832 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:54,834 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:46:54,834 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:155 [2021-06-05 21:46:55,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,087 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:55,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:55,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,095 INFO L388 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 39 treesize of output 31 [2021-06-05 21:46:55,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:55,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,103 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:55,104 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:55,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,111 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:55,112 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:55,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,118 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:55,119 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:55,220 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2021-06-05 21:46:55,220 INFO L628 ElimStorePlain]: treesize reduction 167, result has 44.5 percent of original size [2021-06-05 21:46:55,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,223 INFO L388 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 29 treesize of output 23 [2021-06-05 21:46:55,224 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:55,259 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:55,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,263 INFO L388 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 [2021-06-05 21:46:55,264 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:55,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:55,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,302 INFO L388 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 [2021-06-05 21:46:55,304 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:55,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,307 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:55,309 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:55,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:55,312 INFO L388 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 21 treesize of output 13 [2021-06-05 21:46:55,312 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:55,346 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:55,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:46:55,349 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:344, output treesize:62 [2021-06-05 21:46:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:55,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025920123] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:55,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:55,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:46:55,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511224033] [2021-06-05 21:46:55,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:46:55,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:55,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:46:55,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:46:55,403 INFO L87 Difference]: Start difference. First operand 379 states and 1210 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:55,834 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2021-06-05 21:46:56,139 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 81 [2021-06-05 21:46:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:56,238 INFO L93 Difference]: Finished difference Result 442 states and 1378 transitions. [2021-06-05 21:46:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:46:56,238 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:56,239 INFO L225 Difference]: With dead ends: 442 [2021-06-05 21:46:56,239 INFO L226 Difference]: Without dead ends: 432 [2021-06-05 21:46:56,239 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1287.7ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:46:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-06-05 21:46:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 381. [2021-06-05 21:46:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.2) internal successors, (1216), 380 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1216 transitions. [2021-06-05 21:46:56,243 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1216 transitions. Word has length 17 [2021-06-05 21:46:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:56,243 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1216 transitions. [2021-06-05 21:46:56,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1216 transitions. [2021-06-05 21:46:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:56,244 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:56,244 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:56,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2032,222 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:56,445 INFO L430 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1907866476, now seen corresponding path program 76 times [2021-06-05 21:46:56,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:56,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927422106] [2021-06-05 21:46:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:56,677 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-06-05 21:46:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:57,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:57,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927422106] [2021-06-05 21:46:57,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927422106] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:57,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272537469] [2021-06-05 21:46:57,041 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:57,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:46:57,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:57,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:46:57,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:57,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,246 INFO L388 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 11 [2021-06-05 21:46:57,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,250 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:57,251 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:57,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,307 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:57,308 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,311 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:57,312 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:57,361 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:57,362 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:180, output treesize:150 [2021-06-05 21:46:57,497 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_2]} [2021-06-05 21:46:57,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,503 INFO L388 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 29 treesize of output 23 [2021-06-05 21:46:57,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,508 INFO L388 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 11 [2021-06-05 21:46:57,509 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,513 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:57,514 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,518 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:57,519 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,523 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:57,524 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,529 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:57,529 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,534 INFO L388 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 35 treesize of output 27 [2021-06-05 21:46:57,534 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,538 INFO L388 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 39 treesize of output 31 [2021-06-05 21:46:57,539 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,684 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2021-06-05 21:46:57,685 INFO L628 ElimStorePlain]: treesize reduction 140, result has 56.1 percent of original size [2021-06-05 21:46:57,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,689 INFO L388 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 25 treesize of output 17 [2021-06-05 21:46:57,690 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,694 INFO L388 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 21 treesize of output 13 [2021-06-05 21:46:57,695 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,699 INFO L388 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 [2021-06-05 21:46:57,700 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:57,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:57,703 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:57,704 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:57,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:57,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:57,764 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:387, output treesize:101 [2021-06-05 21:46:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:57,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272537469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:57,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:57,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:46:57,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657144936] [2021-06-05 21:46:57,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:46:57,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:57,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:46:57,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:46:57,896 INFO L87 Difference]: Start difference. First operand 381 states and 1216 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:46:58,491 INFO L93 Difference]: Finished difference Result 449 states and 1404 transitions. [2021-06-05 21:46:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:46:58,491 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:46:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:46:58,492 INFO L225 Difference]: With dead ends: 449 [2021-06-05 21:46:58,492 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 21:46:58,492 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1116.3ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:46:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 21:46:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2021-06-05 21:46:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.202099737532808) internal successors, (1220), 381 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1220 transitions. [2021-06-05 21:46:58,496 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1220 transitions. Word has length 17 [2021-06-05 21:46:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:46:58,496 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1220 transitions. [2021-06-05 21:46:58,496 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:46:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1220 transitions. [2021-06-05 21:46:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:46:58,497 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:46:58,497 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:46:58,697 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 223 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2045 [2021-06-05 21:46:58,697 INFO L430 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:46:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:46:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1365201684, now seen corresponding path program 77 times [2021-06-05 21:46:58,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:46:58,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905636632] [2021-06-05 21:46:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:46:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:46:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:59,020 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:46:59,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905636632] [2021-06-05 21:46:59,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905636632] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:59,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354958325] [2021-06-05 21:46:59,020 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:46:59,048 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:46:59,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:46:59,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:46:59,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:46:59,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,171 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:59,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,174 INFO L388 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 27 treesize of output 21 [2021-06-05 21:46:59,175 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:59,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,214 INFO L388 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 25 treesize of output 19 [2021-06-05 21:46:59,215 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,218 INFO L388 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 11 [2021-06-05 21:46:59,218 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:59,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:46:59,253 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:106 [2021-06-05 21:46:59,396 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_590, v_prenex_592, v_prenex_594], 1=[v_prenex_591, array_4, v_prenex_593, v_prenex_595]} [2021-06-05 21:46:59,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:59,401 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:46:59,406 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,500 INFO L628 ElimStorePlain]: treesize reduction 93, result has 59.7 percent of original size [2021-06-05 21:46:59,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:46:59,505 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:59,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 21:46:59,547 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:46:59,551 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:59,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:46:59,588 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,619 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:59,619 INFO L518 ElimStorePlain]: Eliminatee v_prenex_591 vanished before elimination [2021-06-05 21:46:59,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,623 INFO L388 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 [2021-06-05 21:46:59,624 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:59,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:59,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,659 INFO L388 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 10 treesize of output 6 [2021-06-05 21:46:59,660 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:59,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,664 INFO L388 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 12 treesize of output 8 [2021-06-05 21:46:59,665 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:46:59,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:59,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:46:59,697 INFO L388 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 22 treesize of output 14 [2021-06-05 21:46:59,698 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:46:59,726 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:46:59,729 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:46:59,729 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:249, output treesize:48 [2021-06-05 21:46:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:46:59,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354958325] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:46:59,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:46:59,785 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:46:59,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249689671] [2021-06-05 21:46:59,785 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:46:59,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:46:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:46:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:46:59,785 INFO L87 Difference]: Start difference. First operand 382 states and 1220 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:00,408 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2021-06-05 21:47:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:00,502 INFO L93 Difference]: Finished difference Result 444 states and 1386 transitions. [2021-06-05 21:47:00,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:47:00,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:00,503 INFO L225 Difference]: With dead ends: 444 [2021-06-05 21:47:00,503 INFO L226 Difference]: Without dead ends: 434 [2021-06-05 21:47:00,504 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 872.7ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:47:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-06-05 21:47:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 384. [2021-06-05 21:47:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.2010443864229763) internal successors, (1226), 383 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1226 transitions. [2021-06-05 21:47:00,508 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1226 transitions. Word has length 17 [2021-06-05 21:47:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:00,508 INFO L482 AbstractCegarLoop]: Abstraction has 384 states and 1226 transitions. [2021-06-05 21:47:00,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1226 transitions. [2021-06-05 21:47:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:00,508 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:00,508 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:00,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 224 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2073 [2021-06-05 21:47:00,709 INFO L430 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1022618172, now seen corresponding path program 78 times [2021-06-05 21:47:00,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:00,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962618029] [2021-06-05 21:47:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:00,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:00,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962618029] [2021-06-05 21:47:00,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962618029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:00,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556203697] [2021-06-05 21:47:00,950 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:00,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 21:47:00,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:00,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:00,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:01,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,106 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:01,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,111 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:01,112 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,116 INFO L388 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 11 [2021-06-05 21:47:01,117 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,121 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:01,122 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,184 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:01,187 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:01,188 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:205, output treesize:171 [2021-06-05 21:47:01,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,390 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:01,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,396 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:01,396 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,560 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2021-06-05 21:47:01,561 INFO L628 ElimStorePlain]: treesize reduction 148, result has 59.2 percent of original size [2021-06-05 21:47:01,565 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:01,566 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:01,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,635 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:01,636 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:01,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:01,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,706 INFO L388 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 29 treesize of output 23 [2021-06-05 21:47:01,707 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,711 INFO L388 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 39 treesize of output 31 [2021-06-05 21:47:01,712 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:01,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,776 INFO L388 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 [2021-06-05 21:47:01,777 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:01,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:01,781 INFO L388 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 25 treesize of output 17 [2021-06-05 21:47:01,782 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,840 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:01,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:01,844 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:01,900 INFO L518 ElimStorePlain]: Eliminatee v_prenex_600 vanished before elimination [2021-06-05 21:47:01,903 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:01,904 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:01,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:01,960 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:01,960 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:379, output treesize:101 [2021-06-05 21:47:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:02,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556203697] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:02,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:02,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:47:02,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998140759] [2021-06-05 21:47:02,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:02,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:02,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:02,095 INFO L87 Difference]: Start difference. First operand 384 states and 1226 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:02,513 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2021-06-05 21:47:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:02,734 INFO L93 Difference]: Finished difference Result 442 states and 1380 transitions. [2021-06-05 21:47:02,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:47:02,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:02,735 INFO L225 Difference]: With dead ends: 442 [2021-06-05 21:47:02,735 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 21:47:02,735 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 818.1ms TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:47:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 21:47:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 382. [2021-06-05 21:47:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.202099737532808) internal successors, (1220), 381 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1220 transitions. [2021-06-05 21:47:02,739 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1220 transitions. Word has length 17 [2021-06-05 21:47:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:02,739 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1220 transitions. [2021-06-05 21:47:02,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1220 transitions. [2021-06-05 21:47:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:02,740 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:02,740 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:02,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2098,225 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:02,963 INFO L430 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1599914564, now seen corresponding path program 79 times [2021-06-05 21:47:02,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:02,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040904634] [2021-06-05 21:47:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:03,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:03,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040904634] [2021-06-05 21:47:03,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040904634] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:03,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671650363] [2021-06-05 21:47:03,257 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:03,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:03,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:03,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:03,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:03,393 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:03,394 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:03,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:03,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:03,398 INFO L388 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 11 [2021-06-05 21:47:03,399 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:03,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:03,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:03,403 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:03,404 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:03,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:03,407 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:03,408 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:03,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:03,468 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:03,468 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:162 [2021-06-05 21:47:03,870 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_614, v_prenex_616, array_0, v_prenex_618, v_prenex_620, v_prenex_612], 1=[v_prenex_613, v_prenex_615, v_prenex_617, v_prenex_619, array_4, v_prenex_621]} [2021-06-05 21:47:03,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:03,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:03,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:03,884 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,055 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2021-06-05 21:47:04,055 INFO L628 ElimStorePlain]: treesize reduction 198, result has 53.6 percent of original size [2021-06-05 21:47:04,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:04,061 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:04,137 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:04,201 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:04,261 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:47:04,320 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 21:47:04,325 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:04,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:04,379 INFO L388 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 25 treesize of output 17 [2021-06-05 21:47:04,379 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:04,383 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:04,384 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:04,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:04,436 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:04,437 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:04,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,485 INFO L518 ElimStorePlain]: Eliminatee v_prenex_617 vanished before elimination [2021-06-05 21:47:04,485 INFO L518 ElimStorePlain]: Eliminatee v_prenex_619 vanished before elimination [2021-06-05 21:47:04,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:04,489 INFO L388 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 [2021-06-05 21:47:04,491 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:04,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:04,543 INFO L388 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 [2021-06-05 21:47:04,545 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:04,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:04,594 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:47:04,594 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:443, output treesize:71 [2021-06-05 21:47:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:04,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671650363] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:04,664 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:04,664 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:47:04,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220665827] [2021-06-05 21:47:04,664 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:04,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:04,664 INFO L87 Difference]: Start difference. First operand 382 states and 1220 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:05,122 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2021-06-05 21:47:05,411 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91 [2021-06-05 21:47:05,949 WARN L205 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 146 [2021-06-05 21:47:06,275 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 107 [2021-06-05 21:47:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:06,375 INFO L93 Difference]: Finished difference Result 543 states and 1673 transitions. [2021-06-05 21:47:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:47:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:06,377 INFO L225 Difference]: With dead ends: 543 [2021-06-05 21:47:06,377 INFO L226 Difference]: Without dead ends: 527 [2021-06-05 21:47:06,377 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1812.9ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:47:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-06-05 21:47:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 426. [2021-06-05 21:47:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.284705882352941) internal successors, (1396), 425 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1396 transitions. [2021-06-05 21:47:06,383 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1396 transitions. Word has length 17 [2021-06-05 21:47:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:06,383 INFO L482 AbstractCegarLoop]: Abstraction has 426 states and 1396 transitions. [2021-06-05 21:47:06,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1396 transitions. [2021-06-05 21:47:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:06,384 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:06,384 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:06,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 226 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2133 [2021-06-05 21:47:06,601 INFO L430 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1275471968, now seen corresponding path program 80 times [2021-06-05 21:47:06,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:06,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139944364] [2021-06-05 21:47:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:06,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:06,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139944364] [2021-06-05 21:47:06,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139944364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:06,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760431883] [2021-06-05 21:47:06,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:07,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:47:07,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:07,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:07,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:07,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,086 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:07,086 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,097 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:07,097 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,101 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:07,102 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,105 INFO L388 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 11 [2021-06-05 21:47:07,106 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:07,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:07,153 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:142 [2021-06-05 21:47:07,326 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_622], 1=[array_4, v_prenex_623]} [2021-06-05 21:47:07,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:47:07,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:47:07,336 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:07,340 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:07,345 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,486 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-06-05 21:47:07,486 INFO L628 ElimStorePlain]: treesize reduction 149, result has 56.3 percent of original size [2021-06-05 21:47:07,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:07,490 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 21:47:07,495 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:07,499 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:07,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,558 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:07,559 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:07,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:07,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,618 INFO L388 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 25 treesize of output 17 [2021-06-05 21:47:07,618 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,622 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:07,623 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:07,626 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:07,626 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:07,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:07,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:07,677 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:379, output treesize:125 [2021-06-05 21:47:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:07,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760431883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:07,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:07,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:47:07,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026297118] [2021-06-05 21:47:07,835 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:07,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:07,836 INFO L87 Difference]: Start difference. First operand 426 states and 1396 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:08,261 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2021-06-05 21:47:08,578 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2021-06-05 21:47:08,870 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2021-06-05 21:47:09,121 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2021-06-05 21:47:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:09,228 INFO L93 Difference]: Finished difference Result 523 states and 1617 transitions. [2021-06-05 21:47:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:47:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:09,229 INFO L225 Difference]: With dead ends: 523 [2021-06-05 21:47:09,229 INFO L226 Difference]: Without dead ends: 509 [2021-06-05 21:47:09,229 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1667.1ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:47:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-06-05 21:47:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 423. [2021-06-05 21:47:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.286729857819905) internal successors, (1387), 422 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1387 transitions. [2021-06-05 21:47:09,233 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1387 transitions. Word has length 17 [2021-06-05 21:47:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:09,233 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1387 transitions. [2021-06-05 21:47:09,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1387 transitions. [2021-06-05 21:47:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:09,234 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:09,234 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:09,434 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2164,227 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:09,435 INFO L430 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash -324965886, now seen corresponding path program 81 times [2021-06-05 21:47:09,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:09,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109062079] [2021-06-05 21:47:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:09,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:09,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109062079] [2021-06-05 21:47:09,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109062079] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:09,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493159338] [2021-06-05 21:47:09,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:09,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:47:09,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:09,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 21:47:09,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:09,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:09,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:09,926 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:09,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:09,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:09,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:09,931 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:09,932 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:09,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:09,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:09,936 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:09,936 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:09,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:09,940 INFO L388 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 11 [2021-06-05 21:47:09,941 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,001 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:10,003 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:10,003 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:217, output treesize:182 [2021-06-05 21:47:10,113 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_624, v_prenex_626, array_0, v_prenex_628], 1=[v_prenex_625, v_prenex_627, v_prenex_629, array_4]} [2021-06-05 21:47:10,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:47:10,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:10,124 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,294 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2021-06-05 21:47:10,294 INFO L628 ElimStorePlain]: treesize reduction 173, result has 56.6 percent of original size [2021-06-05 21:47:10,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 21:47:10,299 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:47:10,304 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,377 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:10,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:10,382 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,509 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 21:47:10,509 INFO L628 ElimStorePlain]: treesize reduction 4, result has 98.0 percent of original size [2021-06-05 21:47:10,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:10,513 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:10,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:10,578 INFO L388 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 [2021-06-05 21:47:10,579 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:10,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:10,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:10,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:10,642 INFO L388 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 21 treesize of output 13 [2021-06-05 21:47:10,643 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:10,646 INFO L388 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 24 treesize of output 16 [2021-06-05 21:47:10,647 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:10,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:10,703 INFO L518 ElimStorePlain]: Eliminatee v_prenex_629 vanished before elimination [2021-06-05 21:47:10,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:10,707 INFO L388 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 [2021-06-05 21:47:10,708 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:10,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:10,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:10,765 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:411, output treesize:148 [2021-06-05 21:47:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:10,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493159338] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:10,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:10,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:47:10,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324666697] [2021-06-05 21:47:10,937 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:10,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:10,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:10,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:10,938 INFO L87 Difference]: Start difference. First operand 423 states and 1387 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:11,545 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 21:47:11,978 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 21:47:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:12,098 INFO L93 Difference]: Finished difference Result 491 states and 1563 transitions. [2021-06-05 21:47:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:47:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:12,099 INFO L225 Difference]: With dead ends: 491 [2021-06-05 21:47:12,099 INFO L226 Difference]: Without dead ends: 481 [2021-06-05 21:47:12,099 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1394.2ms TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:47:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-05 21:47:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 425. [2021-06-05 21:47:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.285377358490566) internal successors, (1393), 424 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1393 transitions. [2021-06-05 21:47:12,103 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1393 transitions. Word has length 17 [2021-06-05 21:47:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:12,104 INFO L482 AbstractCegarLoop]: Abstraction has 425 states and 1393 transitions. [2021-06-05 21:47:12,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1393 transitions. [2021-06-05 21:47:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:12,104 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:12,104 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:12,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 228 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2177 [2021-06-05 21:47:12,305 INFO L430 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash 17617626, now seen corresponding path program 82 times [2021-06-05 21:47:12,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:12,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919725101] [2021-06-05 21:47:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:12,632 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:12,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919725101] [2021-06-05 21:47:12,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919725101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:12,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836602405] [2021-06-05 21:47:12,632 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:12,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:47:12,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:12,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:12,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:12,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:12,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:12,837 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:12,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:12,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:12,841 INFO L388 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 11 [2021-06-05 21:47:12,842 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:12,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:12,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:12,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:12,882 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:12,883 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:12,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:12,886 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:12,887 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:12,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:12,921 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:12,922 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:99 [2021-06-05 21:47:13,035 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_636, v_prenex_638, array_0, v_prenex_634], 1=[v_prenex_635, v_prenex_637, v_prenex_639, array_2]} [2021-06-05 21:47:13,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:47:13,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:13,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:13,046 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:13,137 INFO L628 ElimStorePlain]: treesize reduction 85, result has 61.9 percent of original size [2021-06-05 21:47:13,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:47:13,141 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:13,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:13,145 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:13,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:13,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:13,184 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:13,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:13,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:13,220 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:13,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:13,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:13,253 INFO L388 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 [2021-06-05 21:47:13,255 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:13,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:13,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:13,288 INFO L388 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 13 treesize of output 9 [2021-06-05 21:47:13,289 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:13,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:13,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:13,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:13,323 INFO L388 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 12 treesize of output 8 [2021-06-05 21:47:13,324 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:13,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:13,327 INFO L388 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 12 treesize of output 8 [2021-06-05 21:47:13,328 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:13,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:13,358 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:47:13,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:13,360 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:235, output treesize:48 [2021-06-05 21:47:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:13,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836602405] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:13,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:13,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:47:13,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929195141] [2021-06-05 21:47:13,420 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:47:13,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:47:13,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:47:13,421 INFO L87 Difference]: Start difference. First operand 425 states and 1393 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:13,879 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 21:47:14,110 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2021-06-05 21:47:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:14,295 INFO L93 Difference]: Finished difference Result 489 states and 1557 transitions. [2021-06-05 21:47:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:47:14,296 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:14,296 INFO L225 Difference]: With dead ends: 489 [2021-06-05 21:47:14,297 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 21:47:14,297 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1010.9ms TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:47:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 21:47:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 422. [2021-06-05 21:47:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 21:47:14,301 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 21:47:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:14,301 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 21:47:14,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 21:47:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:14,302 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:14,302 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:14,502 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 229 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2192 [2021-06-05 21:47:14,502 INFO L430 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:14,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash -574938828, now seen corresponding path program 83 times [2021-06-05 21:47:14,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:14,503 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761522963] [2021-06-05 21:47:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:14,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:14,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761522963] [2021-06-05 21:47:14,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761522963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:14,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514933551] [2021-06-05 21:47:14,834 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:14,862 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:47:14,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:14,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:14,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:14,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:47:14,955 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:14,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:14,958 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:14,987 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:14,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:14,991 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:14,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:14,994 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:15,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:15,020 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:15,020 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:101 [2021-06-05 21:47:15,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:15,198 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:15,198 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:15,272 INFO L628 ElimStorePlain]: treesize reduction 123, result has 47.9 percent of original size [2021-06-05 21:47:15,272 INFO L518 ElimStorePlain]: Eliminatee v_prenex_648 vanished before elimination [2021-06-05 21:47:15,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:15,275 INFO L388 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 29 treesize of output 23 [2021-06-05 21:47:15,276 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:15,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:15,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:15,304 INFO L388 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 [2021-06-05 21:47:15,306 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:15,330 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:15,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:15,333 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:15,334 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:15,356 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:15,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:15,360 INFO L388 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 [2021-06-05 21:47:15,361 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:15,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:15,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:15,393 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:15,394 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:15,414 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:15,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:15,417 INFO L388 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 21 treesize of output 13 [2021-06-05 21:47:15,418 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:15,438 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:15,439 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:15,440 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 21:47:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:15,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514933551] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:15,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:15,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:47:15,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153321952] [2021-06-05 21:47:15,475 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:15,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:15,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:15,476 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:16,049 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-06-05 21:47:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:16,149 INFO L93 Difference]: Finished difference Result 491 states and 1567 transitions. [2021-06-05 21:47:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:47:16,150 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:16,150 INFO L225 Difference]: With dead ends: 491 [2021-06-05 21:47:16,151 INFO L226 Difference]: Without dead ends: 481 [2021-06-05 21:47:16,151 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 833.4ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:47:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-05 21:47:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 423. [2021-06-05 21:47:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.2914691943127963) internal successors, (1389), 422 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1389 transitions. [2021-06-05 21:47:16,155 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1389 transitions. Word has length 17 [2021-06-05 21:47:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:16,155 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1389 transitions. [2021-06-05 21:47:16,155 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1389 transitions. [2021-06-05 21:47:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:16,156 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:16,156 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:16,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 230 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2217 [2021-06-05 21:47:16,357 INFO L430 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash 906299042, now seen corresponding path program 84 times [2021-06-05 21:47:16,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:16,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724944281] [2021-06-05 21:47:16,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:16,549 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:16,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724944281] [2021-06-05 21:47:16,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724944281] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:16,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820694265] [2021-06-05 21:47:16,549 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:16,590 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:47:16,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:16,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:16,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:16,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:16,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:16,709 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:16,710 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:16,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:16,713 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:16,714 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:16,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:16,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:16,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:16,754 INFO L388 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 11 [2021-06-05 21:47:16,754 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:16,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:16,757 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:16,758 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:16,790 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:16,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:16,793 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:112 [2021-06-05 21:47:16,902 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_658, array_0, v_prenex_654, v_prenex_656], 1=[v_prenex_657, v_prenex_659, array_4, v_prenex_655]} [2021-06-05 21:47:16,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 21:47:16,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:16,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:47:16,912 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:16,978 INFO L628 ElimStorePlain]: treesize reduction 124, result has 44.4 percent of original size [2021-06-05 21:47:16,978 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:47:16,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:16,982 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:17,005 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:17,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:17,009 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:17,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:17,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:17,034 INFO L388 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 [2021-06-05 21:47:17,035 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:17,057 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:17,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:17,060 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:17,061 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:17,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:17,083 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:47:17,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:17,086 INFO L388 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 [2021-06-05 21:47:17,087 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:17,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:17,117 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:17,118 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:241, output treesize:38 [2021-06-05 21:47:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:17,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820694265] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:17,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:17,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:47:17,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510486989] [2021-06-05 21:47:17,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:47:17,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:47:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:47:17,158 INFO L87 Difference]: Start difference. First operand 423 states and 1389 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:17,760 INFO L93 Difference]: Finished difference Result 489 states and 1563 transitions. [2021-06-05 21:47:17,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:47:17,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:17,761 INFO L225 Difference]: With dead ends: 489 [2021-06-05 21:47:17,761 INFO L226 Difference]: Without dead ends: 479 [2021-06-05 21:47:17,761 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 614.3ms TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:47:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-06-05 21:47:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 422. [2021-06-05 21:47:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 21:47:17,765 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 21:47:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:17,765 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 21:47:17,765 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 21:47:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:17,766 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:17,766 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:17,966 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 231 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2259 [2021-06-05 21:47:17,967 INFO L430 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1455215452, now seen corresponding path program 85 times [2021-06-05 21:47:17,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:17,967 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376551488] [2021-06-05 21:47:17,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:18,299 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 21:47:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:18,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:18,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376551488] [2021-06-05 21:47:18,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376551488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:18,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017183745] [2021-06-05 21:47:18,514 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:18,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:18,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:18,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:18,643 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:18,644 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:18,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:18,647 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:18,648 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:18,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:18,651 INFO L388 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 11 [2021-06-05 21:47:18,652 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:18,655 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:18,656 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:18,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:18,713 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:18,713 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:163 [2021-06-05 21:47:19,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,013 INFO L388 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 21 treesize of output 17 [2021-06-05 21:47:19,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:19,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,019 INFO L388 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 19 treesize of output 15 [2021-06-05 21:47:19,019 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:19,134 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2021-06-05 21:47:19,134 INFO L628 ElimStorePlain]: treesize reduction 179, result has 44.2 percent of original size [2021-06-05 21:47:19,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,138 INFO L388 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 12 treesize of output 8 [2021-06-05 21:47:19,140 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:19,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,143 INFO L388 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 [2021-06-05 21:47:19,149 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:19,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:19,190 INFO L518 ElimStorePlain]: Eliminatee v_prenex_660 vanished before elimination [2021-06-05 21:47:19,190 INFO L518 ElimStorePlain]: Eliminatee v_prenex_661 vanished before elimination [2021-06-05 21:47:19,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,194 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:19,194 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:19,232 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:19,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,236 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:19,237 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:19,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:19,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,277 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:19,278 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:19,313 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:19,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:19,317 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:19,318 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:19,352 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:19,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:47:19,355 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:336, output treesize:67 [2021-06-05 21:47:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:19,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017183745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:19,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:19,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:47:19,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922948520] [2021-06-05 21:47:19,410 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:47:19,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:19,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:47:19,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:47:19,410 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:19,815 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2021-06-05 21:47:20,120 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2021-06-05 21:47:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:20,210 INFO L93 Difference]: Finished difference Result 488 states and 1561 transitions. [2021-06-05 21:47:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:47:20,210 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:20,211 INFO L225 Difference]: With dead ends: 488 [2021-06-05 21:47:20,211 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 21:47:20,211 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1321.4ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:47:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 21:47:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 424. [2021-06-05 21:47:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 3.2884160756501184) internal successors, (1391), 423 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1391 transitions. [2021-06-05 21:47:20,216 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1391 transitions. Word has length 17 [2021-06-05 21:47:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:20,216 INFO L482 AbstractCegarLoop]: Abstraction has 424 states and 1391 transitions. [2021-06-05 21:47:20,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1391 transitions. [2021-06-05 21:47:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:20,217 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:20,217 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:20,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 232 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2289 [2021-06-05 21:47:20,417 INFO L430 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 640409298, now seen corresponding path program 86 times [2021-06-05 21:47:20,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:20,418 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856935155] [2021-06-05 21:47:20,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:20,626 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-06-05 21:47:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:20,904 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:20,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856935155] [2021-06-05 21:47:20,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856935155] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:20,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932569199] [2021-06-05 21:47:20,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:20,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:47:20,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:20,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:20,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:21,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,050 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:21,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,056 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:21,057 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,094 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:21,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,097 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:21,098 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,101 INFO L388 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 11 [2021-06-05 21:47:21,102 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,133 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:21,136 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:21,136 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:109 [2021-06-05 21:47:21,245 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_673, v_prenex_675, v_prenex_677], 1=[array_2, v_prenex_674, v_prenex_676, v_prenex_678]} [2021-06-05 21:47:21,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:47:21,251 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:47:21,255 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,322 INFO L628 ElimStorePlain]: treesize reduction 112, result has 47.7 percent of original size [2021-06-05 21:47:21,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:21,325 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:21,349 INFO L518 ElimStorePlain]: Eliminatee v_prenex_675 vanished before elimination [2021-06-05 21:47:21,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:21,352 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:21,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,383 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:21,384 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:21,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,408 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:21,409 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:21,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:21,429 INFO L518 ElimStorePlain]: Eliminatee v_prenex_676 vanished before elimination [2021-06-05 21:47:21,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:21,432 INFO L388 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 13 treesize of output 9 [2021-06-05 21:47:21,433 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:21,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:21,456 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:21,456 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 21:47:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:21,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932569199] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:21,497 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:21,497 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:47:21,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361419166] [2021-06-05 21:47:21,497 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:21,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:21,497 INFO L87 Difference]: Start difference. First operand 424 states and 1391 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:21,964 INFO L93 Difference]: Finished difference Result 485 states and 1553 transitions. [2021-06-05 21:47:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:47:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:21,965 INFO L225 Difference]: With dead ends: 485 [2021-06-05 21:47:21,965 INFO L226 Difference]: Without dead ends: 474 [2021-06-05 21:47:21,966 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 804.6ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:47:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-06-05 21:47:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 422. [2021-06-05 21:47:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 21:47:21,970 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 21:47:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:21,970 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 21:47:21,970 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 21:47:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:21,971 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:21,971 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:22,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 233 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2334 [2021-06-05 21:47:22,171 INFO L430 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:22,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:22,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1662308434, now seen corresponding path program 87 times [2021-06-05 21:47:22,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:22,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578382383] [2021-06-05 21:47:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:22,465 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:22,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578382383] [2021-06-05 21:47:22,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578382383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:22,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975809858] [2021-06-05 21:47:22,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:22,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:47:22,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:22,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 21:47:22,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:22,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,605 INFO L388 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 11 [2021-06-05 21:47:22,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,610 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:22,610 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,615 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:22,615 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,619 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:22,620 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:22,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:22,696 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:245, output treesize:214 [2021-06-05 21:47:22,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,837 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:22,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,842 INFO L388 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 38 treesize of output 30 [2021-06-05 21:47:22,843 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,847 INFO L388 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 11 [2021-06-05 21:47:22,847 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,851 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:22,852 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,856 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:22,857 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,861 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:22,862 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:22,866 INFO L388 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 28 treesize of output 22 [2021-06-05 21:47:22,867 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:22,871 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:22,871 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:23,085 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-05 21:47:23,085 INFO L628 ElimStorePlain]: treesize reduction 185, result has 58.7 percent of original size [2021-06-05 21:47:23,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:23,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:23,090 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:23,091 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:23,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:23,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:23,094 INFO L388 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 21 treesize of output 13 [2021-06-05 21:47:23,095 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:23,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:23,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:23,099 INFO L388 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 24 treesize of output 16 [2021-06-05 21:47:23,100 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:23,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:23,103 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:23,104 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:23,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:23,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:23,198 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:515, output treesize:212 [2021-06-05 21:47:23,499 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 21:47:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:23,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975809858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:23,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:23,615 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 21:47:23,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264377713] [2021-06-05 21:47:23,616 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:47:23,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:47:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:47:23,616 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:23,972 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2021-06-05 21:47:24,221 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2021-06-05 21:47:24,586 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2021-06-05 21:47:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:24,790 INFO L93 Difference]: Finished difference Result 504 states and 1582 transitions. [2021-06-05 21:47:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:47:24,790 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:24,791 INFO L225 Difference]: With dead ends: 504 [2021-06-05 21:47:24,791 INFO L226 Difference]: Without dead ends: 484 [2021-06-05 21:47:24,791 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1665.7ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:47:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-06-05 21:47:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 422. [2021-06-05 21:47:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.2921615201900236) internal successors, (1386), 421 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1386 transitions. [2021-06-05 21:47:24,796 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1386 transitions. Word has length 17 [2021-06-05 21:47:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:24,796 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1386 transitions. [2021-06-05 21:47:24,796 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1386 transitions. [2021-06-05 21:47:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:24,796 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:24,797 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:24,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 234 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2364 [2021-06-05 21:47:24,997 INFO L430 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:24,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2004891946, now seen corresponding path program 88 times [2021-06-05 21:47:24,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:24,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565834651] [2021-06-05 21:47:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:25,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:25,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565834651] [2021-06-05 21:47:25,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565834651] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:25,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529954357] [2021-06-05 21:47:25,288 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:25,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:47:25,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:25,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:25,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:25,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,470 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:25,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,475 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:25,476 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:25,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,522 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:25,523 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,527 INFO L388 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 11 [2021-06-05 21:47:25,528 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:25,570 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:25,570 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:105 [2021-06-05 21:47:25,719 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_683, v_prenex_685, v_prenex_687], 1=[array_2, v_prenex_684, v_prenex_686, v_prenex_688]} [2021-06-05 21:47:25,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:47:25,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:25,732 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,836 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2021-06-05 21:47:25,836 INFO L628 ElimStorePlain]: treesize reduction 81, result has 64.6 percent of original size [2021-06-05 21:47:25,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:47:25,841 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:47:25,846 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:25,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:25,886 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,919 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:25,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:25,923 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:25,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:25,955 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:47:25,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,959 INFO L388 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 12 treesize of output 8 [2021-06-05 21:47:25,960 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:25,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,963 INFO L388 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 [2021-06-05 21:47:25,964 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:25,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:25,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:25,998 INFO L388 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 [2021-06-05 21:47:25,999 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:26,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:26,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:26,033 INFO L388 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 13 treesize of output 9 [2021-06-05 21:47:26,034 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:26,063 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:26,065 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:26,066 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:247, output treesize:48 [2021-06-05 21:47:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:26,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529954357] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:26,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:26,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:47:26,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615317582] [2021-06-05 21:47:26,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:47:26,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:26,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:47:26,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:47:26,124 INFO L87 Difference]: Start difference. First operand 422 states and 1386 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:26,628 INFO L93 Difference]: Finished difference Result 484 states and 1551 transitions. [2021-06-05 21:47:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:47:26,629 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:26,629 INFO L225 Difference]: With dead ends: 484 [2021-06-05 21:47:26,629 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 21:47:26,629 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 748.0ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:47:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 21:47:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 421. [2021-06-05 21:47:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.295238095238095) internal successors, (1384), 420 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1384 transitions. [2021-06-05 21:47:26,634 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1384 transitions. Word has length 17 [2021-06-05 21:47:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:26,634 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1384 transitions. [2021-06-05 21:47:26,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1384 transitions. [2021-06-05 21:47:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:26,635 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:26,635 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:26,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2383,235 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:26,835 INFO L430 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash 569417172, now seen corresponding path program 89 times [2021-06-05 21:47:26,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:26,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524855131] [2021-06-05 21:47:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:27,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:27,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524855131] [2021-06-05 21:47:27,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524855131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:27,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409113220] [2021-06-05 21:47:27,223 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:27,251 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:47:27,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:27,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:27,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:27,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:47:27,352 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:27,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:27,355 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:27,378 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:27,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:27,382 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:27,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:27,385 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:27,404 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:27,405 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:27,405 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:76 [2021-06-05 21:47:27,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:47:27,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:27,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:27,472 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:27,509 INFO L628 ElimStorePlain]: treesize reduction 66, result has 53.5 percent of original size [2021-06-05 21:47:27,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:27,513 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:27,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:27,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 21:47:27,529 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:27,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:27,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:47:27,545 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:27,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:27,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:47:27,560 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:27,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:27,572 INFO L518 ElimStorePlain]: Eliminatee v_prenex_693 vanished before elimination [2021-06-05 21:47:27,573 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:27,573 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 21:47:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:27,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409113220] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:27,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:27,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 21:47:27,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189995370] [2021-06-05 21:47:27,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:47:27,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:47:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:47:27,609 INFO L87 Difference]: Start difference. First operand 421 states and 1384 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:28,136 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-06-05 21:47:28,310 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-06-05 21:47:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:28,379 INFO L93 Difference]: Finished difference Result 506 states and 1606 transitions. [2021-06-05 21:47:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:47:28,379 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:28,380 INFO L225 Difference]: With dead ends: 506 [2021-06-05 21:47:28,380 INFO L226 Difference]: Without dead ends: 494 [2021-06-05 21:47:28,380 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1004.6ms TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:47:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-06-05 21:47:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 421. [2021-06-05 21:47:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.288095238095238) internal successors, (1381), 420 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1381 transitions. [2021-06-05 21:47:28,385 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1381 transitions. Word has length 17 [2021-06-05 21:47:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:28,385 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1381 transitions. [2021-06-05 21:47:28,385 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1381 transitions. [2021-06-05 21:47:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:28,386 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:28,386 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:28,586 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2408,236 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:28,586 INFO L430 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash -245388982, now seen corresponding path program 90 times [2021-06-05 21:47:28,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:28,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440214287] [2021-06-05 21:47:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:28,876 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:28,876 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440214287] [2021-06-05 21:47:28,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440214287] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:28,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542092265] [2021-06-05 21:47:28,877 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:28,904 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:47:28,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:28,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:28,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:29,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,032 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:29,033 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,037 INFO L388 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 11 [2021-06-05 21:47:29,038 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:29,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,078 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:29,079 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,082 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:29,082 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:29,117 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:29,117 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:109 [2021-06-05 21:47:29,234 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_702, array_0, v_prenex_698, v_prenex_700], 1=[v_prenex_701, v_prenex_703, array_2, v_prenex_699]} [2021-06-05 21:47:29,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:29,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:29,244 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,314 INFO L628 ElimStorePlain]: treesize reduction 115, result has 45.8 percent of original size [2021-06-05 21:47:29,314 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:47:29,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:47:29,318 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:29,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:29,345 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,366 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:29,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,369 INFO L388 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 [2021-06-05 21:47:29,370 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:29,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:29,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,394 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:29,396 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:29,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:29,416 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:47:29,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:29,419 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:29,420 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:29,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:29,442 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:29,442 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 21:47:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:29,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542092265] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:29,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:29,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 21:47:29,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697791126] [2021-06-05 21:47:29,483 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:29,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:29,483 INFO L87 Difference]: Start difference. First operand 421 states and 1381 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:30,119 INFO L93 Difference]: Finished difference Result 500 states and 1587 transitions. [2021-06-05 21:47:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:47:30,119 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:30,120 INFO L225 Difference]: With dead ends: 500 [2021-06-05 21:47:30,120 INFO L226 Difference]: Without dead ends: 487 [2021-06-05 21:47:30,120 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 803.7ms TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:47:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-05 21:47:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 415. [2021-06-05 21:47:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.2777777777777777) internal successors, (1357), 414 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1357 transitions. [2021-06-05 21:47:30,125 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1357 transitions. Word has length 17 [2021-06-05 21:47:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:30,125 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1357 transitions. [2021-06-05 21:47:30,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1357 transitions. [2021-06-05 21:47:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:30,125 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:30,126 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:30,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2417,237 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:30,326 INFO L430 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:30,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash 344982116, now seen corresponding path program 91 times [2021-06-05 21:47:30,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:30,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229002610] [2021-06-05 21:47:30,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:30,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:30,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229002610] [2021-06-05 21:47:30,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229002610] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:30,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745649023] [2021-06-05 21:47:30,564 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:30,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:30,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:30,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,693 INFO L388 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 11 [2021-06-05 21:47:30,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,697 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:30,698 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:30,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,740 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:30,741 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,744 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:30,745 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,777 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:30,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:30,780 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:114 [2021-06-05 21:47:30,965 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_2]} [2021-06-05 21:47:30,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,970 INFO L388 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 17 treesize of output 13 [2021-06-05 21:47:30,970 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,975 INFO L388 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 29 treesize of output 23 [2021-06-05 21:47:30,976 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,980 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:30,980 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,985 INFO L388 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 39 treesize of output 31 [2021-06-05 21:47:30,986 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,990 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:30,991 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:30,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:30,995 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:30,996 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:31,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:31,000 INFO L388 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 11 [2021-06-05 21:47:31,001 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:31,005 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:31,006 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:31,159 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2021-06-05 21:47:31,160 INFO L628 ElimStorePlain]: treesize reduction 128, result has 57.5 percent of original size [2021-06-05 21:47:31,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:31,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:31,164 INFO L388 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 25 treesize of output 17 [2021-06-05 21:47:31,165 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:31,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:31,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:31,169 INFO L388 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 [2021-06-05 21:47:31,170 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:31,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:31,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:31,174 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:31,175 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:31,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:31,178 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:31,179 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:31,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:31,238 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:31,238 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:379, output treesize:101 [2021-06-05 21:47:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:31,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745649023] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:31,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:31,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:47:31,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835660126] [2021-06-05 21:47:31,362 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:31,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:31,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:31,362 INFO L87 Difference]: Start difference. First operand 415 states and 1357 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:32,019 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2021-06-05 21:47:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:32,199 INFO L93 Difference]: Finished difference Result 553 states and 1747 transitions. [2021-06-05 21:47:32,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:47:32,200 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:32,200 INFO L225 Difference]: With dead ends: 553 [2021-06-05 21:47:32,200 INFO L226 Difference]: Without dead ends: 539 [2021-06-05 21:47:32,201 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 982.3ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:47:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-06-05 21:47:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 413. [2021-06-05 21:47:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.279126213592233) internal successors, (1351), 412 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1351 transitions. [2021-06-05 21:47:32,205 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1351 transitions. Word has length 17 [2021-06-05 21:47:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:32,205 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 1351 transitions. [2021-06-05 21:47:32,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1351 transitions. [2021-06-05 21:47:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:32,206 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:32,206 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:32,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2447,238 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:32,407 INFO L430 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash -109288126, now seen corresponding path program 92 times [2021-06-05 21:47:32,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:32,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144624344] [2021-06-05 21:47:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:32,731 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:32,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144624344] [2021-06-05 21:47:32,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144624344] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:32,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519632935] [2021-06-05 21:47:32,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:32,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:47:32,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:32,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:32,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:32,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:32,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:32,879 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:32,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:32,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:32,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:32,884 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:32,885 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:32,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:32,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:32,889 INFO L388 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 11 [2021-06-05 21:47:32,889 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:32,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:32,893 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:32,893 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:32,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:32,947 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:32,948 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:158 [2021-06-05 21:47:33,049 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_712, array_0, v_prenex_708, v_prenex_710], 1=[v_prenex_713, array_4, v_prenex_709, v_prenex_711]} [2021-06-05 21:47:33,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 21:47:33,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:33,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:47:33,060 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:33,200 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2021-06-05 21:47:33,200 INFO L628 ElimStorePlain]: treesize reduction 151, result has 55.7 percent of original size [2021-06-05 21:47:33,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:33,205 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:33,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:33,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:33,266 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:33,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:33,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:33,325 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:33,377 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:33,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:33,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:33,382 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:33,383 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:33,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:33,386 INFO L388 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 25 treesize of output 17 [2021-06-05 21:47:33,387 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:33,444 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:33,444 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:47:33,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:33,448 INFO L388 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 [2021-06-05 21:47:33,449 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:33,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:33,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:33,503 INFO L388 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 [2021-06-05 21:47:33,505 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:33,553 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:33,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:33,554 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:363, output treesize:125 [2021-06-05 21:47:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:33,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519632935] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:33,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:33,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 21:47:33,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179775133] [2021-06-05 21:47:33,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:33,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:33,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:33,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:33,712 INFO L87 Difference]: Start difference. First operand 413 states and 1351 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:34,245 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2021-06-05 21:47:34,639 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2021-06-05 21:47:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:34,738 INFO L93 Difference]: Finished difference Result 502 states and 1603 transitions. [2021-06-05 21:47:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:47:34,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:34,739 INFO L225 Difference]: With dead ends: 502 [2021-06-05 21:47:34,740 INFO L226 Difference]: Without dead ends: 492 [2021-06-05 21:47:34,740 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1317.7ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:47:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-06-05 21:47:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 417. [2021-06-05 21:47:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.2764423076923075) internal successors, (1363), 416 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1363 transitions. [2021-06-05 21:47:34,744 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1363 transitions. Word has length 17 [2021-06-05 21:47:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:34,744 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1363 transitions. [2021-06-05 21:47:34,744 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1363 transitions. [2021-06-05 21:47:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:34,745 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:34,745 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:34,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 239 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2475 [2021-06-05 21:47:34,945 INFO L430 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash 233295386, now seen corresponding path program 93 times [2021-06-05 21:47:34,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:34,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264991327] [2021-06-05 21:47:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:35,209 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:35,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264991327] [2021-06-05 21:47:35,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264991327] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:35,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939287931] [2021-06-05 21:47:35,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:35,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 21:47:35,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:35,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:35,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:35,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,367 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:35,368 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,371 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:35,372 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:35,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,411 INFO L388 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 11 [2021-06-05 21:47:35,411 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,415 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:35,415 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:35,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:35,449 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 21:47:35,560 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_718, v_prenex_720, v_prenex_722], 1=[v_prenex_723, array_2, v_prenex_719, v_prenex_721]} [2021-06-05 21:47:35,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:35,566 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:47:35,570 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,669 INFO L628 ElimStorePlain]: treesize reduction 96, result has 58.1 percent of original size [2021-06-05 21:47:35,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:35,674 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:35,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:35,714 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:35,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:35,752 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,784 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:35,784 INFO L518 ElimStorePlain]: Eliminatee v_prenex_723 vanished before elimination [2021-06-05 21:47:35,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,788 INFO L388 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 12 treesize of output 8 [2021-06-05 21:47:35,790 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:35,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,793 INFO L388 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 12 treesize of output 8 [2021-06-05 21:47:35,794 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:35,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:35,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,829 INFO L388 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 21 treesize of output 13 [2021-06-05 21:47:35,830 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:35,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:35,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:35,863 INFO L388 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 [2021-06-05 21:47:35,864 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:35,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:35,896 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:35,896 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:243, output treesize:48 [2021-06-05 21:47:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:35,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939287931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:35,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:35,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:47:35,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927914615] [2021-06-05 21:47:35,955 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:47:35,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:35,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:47:35,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:47:35,955 INFO L87 Difference]: Start difference. First operand 417 states and 1363 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:36,655 INFO L93 Difference]: Finished difference Result 500 states and 1597 transitions. [2021-06-05 21:47:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:47:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:36,656 INFO L225 Difference]: With dead ends: 500 [2021-06-05 21:47:36,656 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 21:47:36,656 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 770.0ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:47:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 21:47:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 415. [2021-06-05 21:47:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.2777777777777777) internal successors, (1357), 414 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1357 transitions. [2021-06-05 21:47:36,661 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1357 transitions. Word has length 17 [2021-06-05 21:47:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:36,661 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1357 transitions. [2021-06-05 21:47:36,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1357 transitions. [2021-06-05 21:47:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:36,662 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:36,662 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:36,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 240 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2490 [2021-06-05 21:47:36,863 INFO L430 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1873488734, now seen corresponding path program 94 times [2021-06-05 21:47:36,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:36,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43086374] [2021-06-05 21:47:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:37,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:37,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43086374] [2021-06-05 21:47:37,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43086374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:37,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106411865] [2021-06-05 21:47:37,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:37,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:47:37,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:37,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:37,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:37,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:37,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:37,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:47:37,180 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:37,209 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:37,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:37,213 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:37,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:37,217 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:37,242 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:37,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:37,245 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:91 [2021-06-05 21:47:37,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:37,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:37,421 INFO L388 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 19 treesize of output 15 [2021-06-05 21:47:37,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:37,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:37,426 INFO L388 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 21 treesize of output 17 [2021-06-05 21:47:37,427 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:37,496 INFO L628 ElimStorePlain]: treesize reduction 110, result has 45.8 percent of original size [2021-06-05 21:47:37,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:37,500 INFO L388 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 12 treesize of output 8 [2021-06-05 21:47:37,503 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:37,527 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:37,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:37,531 INFO L388 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 19 treesize of output 15 [2021-06-05 21:47:37,531 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:37,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:37,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:37,557 INFO L388 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 [2021-06-05 21:47:37,558 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:37,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:37,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:37,584 INFO L388 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 19 treesize of output 15 [2021-06-05 21:47:37,585 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:37,606 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:37,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:37,609 INFO L388 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 13 treesize of output 9 [2021-06-05 21:47:37,611 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:37,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:37,631 INFO L518 ElimStorePlain]: Eliminatee v_prenex_732 vanished before elimination [2021-06-05 21:47:37,631 INFO L518 ElimStorePlain]: Eliminatee v_prenex_733 vanished before elimination [2021-06-05 21:47:37,633 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:37,633 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:215, output treesize:38 [2021-06-05 21:47:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:37,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106411865] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:37,675 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:37,675 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 21:47:37,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972154381] [2021-06-05 21:47:37,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:47:37,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:47:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:47:37,675 INFO L87 Difference]: Start difference. First operand 415 states and 1357 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:38,247 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-06-05 21:47:38,421 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2021-06-05 21:47:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:38,620 INFO L93 Difference]: Finished difference Result 547 states and 1730 transitions. [2021-06-05 21:47:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:47:38,621 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:38,621 INFO L225 Difference]: With dead ends: 547 [2021-06-05 21:47:38,621 INFO L226 Difference]: Without dead ends: 533 [2021-06-05 21:47:38,622 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 954.7ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:47:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-06-05 21:47:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 413. [2021-06-05 21:47:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.279126213592233) internal successors, (1351), 412 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1351 transitions. [2021-06-05 21:47:38,627 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1351 transitions. Word has length 17 [2021-06-05 21:47:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:38,627 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 1351 transitions. [2021-06-05 21:47:38,627 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1351 transitions. [2021-06-05 21:47:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:38,627 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:38,627 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:38,828 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2515,241 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:38,828 INFO L430 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:38,828 INFO L82 PathProgramCache]: Analyzing trace with hash -684833076, now seen corresponding path program 95 times [2021-06-05 21:47:38,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:38,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272078497] [2021-06-05 21:47:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:39,267 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:39,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272078497] [2021-06-05 21:47:39,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272078497] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:39,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046613437] [2021-06-05 21:47:39,267 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:39,295 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:47:39,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:39,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:39,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:39,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,445 INFO L388 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 11 [2021-06-05 21:47:39,445 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,449 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:39,450 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:39,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,493 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:39,494 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,497 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:39,498 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:39,535 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:39,535 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:158, output treesize:119 [2021-06-05 21:47:39,752 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 21:47:39,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,759 INFO L388 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 17 treesize of output 13 [2021-06-05 21:47:39,760 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,767 INFO L388 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 17 treesize of output 13 [2021-06-05 21:47:39,768 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,774 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:39,775 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,781 INFO L388 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 38 treesize of output 30 [2021-06-05 21:47:39,783 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,789 INFO L388 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 28 treesize of output 22 [2021-06-05 21:47:39,790 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,797 INFO L388 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 11 [2021-06-05 21:47:39,798 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,804 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:39,805 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,810 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:39,811 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,954 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2021-06-05 21:47:39,954 INFO L628 ElimStorePlain]: treesize reduction 134, result has 58.0 percent of original size [2021-06-05 21:47:39,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,959 INFO L388 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 [2021-06-05 21:47:39,960 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:39,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,964 INFO L388 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 [2021-06-05 21:47:39,966 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:39,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,970 INFO L388 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 21 treesize of output 13 [2021-06-05 21:47:39,971 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:39,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:39,975 INFO L388 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 25 treesize of output 17 [2021-06-05 21:47:39,975 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:40,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:40,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:40,033 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:389, output treesize:101 [2021-06-05 21:47:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:40,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046613437] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:40,171 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:40,171 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:47:40,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124947064] [2021-06-05 21:47:40,171 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:47:40,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:40,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:47:40,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:47:40,171 INFO L87 Difference]: Start difference. First operand 413 states and 1351 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:40,594 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2021-06-05 21:47:40,858 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2021-06-05 21:47:41,091 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 107 [2021-06-05 21:47:41,395 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2021-06-05 21:47:41,756 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 125 [2021-06-05 21:47:42,164 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 133 [2021-06-05 21:47:42,664 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 132 [2021-06-05 21:47:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:42,876 INFO L93 Difference]: Finished difference Result 640 states and 2012 transitions. [2021-06-05 21:47:42,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:47:42,877 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:42,877 INFO L225 Difference]: With dead ends: 640 [2021-06-05 21:47:42,877 INFO L226 Difference]: Without dead ends: 619 [2021-06-05 21:47:42,878 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2886.8ms TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:47:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-06-05 21:47:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 417. [2021-06-05 21:47:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.2764423076923075) internal successors, (1363), 416 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1363 transitions. [2021-06-05 21:47:42,883 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1363 transitions. Word has length 17 [2021-06-05 21:47:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:42,883 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1363 transitions. [2021-06-05 21:47:42,883 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1363 transitions. [2021-06-05 21:47:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:42,884 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:42,884 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:43,084 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2546,242 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:43,084 INFO L430 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 590115602, now seen corresponding path program 96 times [2021-06-05 21:47:43,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:43,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400030423] [2021-06-05 21:47:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:43,586 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:43,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400030423] [2021-06-05 21:47:43,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400030423] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:43,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787582935] [2021-06-05 21:47:43,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:43,615 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:47:43,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:43,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:43,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:43,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:43,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:43,803 INFO L388 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 11 [2021-06-05 21:47:43,804 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:43,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:43,808 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:43,808 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:43,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:43,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:43,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:43,865 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:43,866 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:43,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:43,870 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:43,870 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:43,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:43,921 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:43,921 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:180, output treesize:145 [2021-06-05 21:47:44,065 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 21:47:44,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,070 INFO L388 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 11 [2021-06-05 21:47:44,070 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,075 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:44,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,080 INFO L388 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 17 treesize of output 13 [2021-06-05 21:47:44,080 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,085 INFO L388 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 28 treesize of output 22 [2021-06-05 21:47:44,085 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,090 INFO L388 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 38 treesize of output 30 [2021-06-05 21:47:44,090 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,095 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:44,096 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,100 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:44,101 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,115 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:44,116 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,253 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2021-06-05 21:47:44,253 INFO L628 ElimStorePlain]: treesize reduction 126, result has 57.9 percent of original size [2021-06-05 21:47:44,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,257 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:44,259 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:44,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,263 INFO L388 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 25 treesize of output 17 [2021-06-05 21:47:44,264 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,268 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:44,268 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:44,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:44,272 INFO L388 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 [2021-06-05 21:47:44,273 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:44,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:44,331 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:44,331 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:377, output treesize:101 [2021-06-05 21:47:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:44,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787582935] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:44,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:44,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:47:44,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005504135] [2021-06-05 21:47:44,461 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:47:44,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:44,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:47:44,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:47:44,461 INFO L87 Difference]: Start difference. First operand 417 states and 1363 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:44,961 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2021-06-05 21:47:45,194 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2021-06-05 21:47:45,346 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-06-05 21:47:45,523 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-06-05 21:47:45,768 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2021-06-05 21:47:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:45,844 INFO L93 Difference]: Finished difference Result 594 states and 1871 transitions. [2021-06-05 21:47:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:47:45,844 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:45,845 INFO L225 Difference]: With dead ends: 594 [2021-06-05 21:47:45,845 INFO L226 Difference]: Without dead ends: 570 [2021-06-05 21:47:45,845 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1666.1ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:47:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-06-05 21:47:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 421. [2021-06-05 21:47:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.276190476190476) internal successors, (1376), 420 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1376 transitions. [2021-06-05 21:47:45,850 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1376 transitions. Word has length 17 [2021-06-05 21:47:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:45,850 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1376 transitions. [2021-06-05 21:47:45,850 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1376 transitions. [2021-06-05 21:47:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:45,851 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:45,851 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:46,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 243 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2569 [2021-06-05 21:47:46,051 INFO L430 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash 932699114, now seen corresponding path program 97 times [2021-06-05 21:47:46,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:46,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311857566] [2021-06-05 21:47:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:46,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:46,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311857566] [2021-06-05 21:47:46,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311857566] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:46,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854919325] [2021-06-05 21:47:46,334 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:46,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:46,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:46,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:46,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:46,508 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:46,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:46,513 INFO L388 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 11 [2021-06-05 21:47:46,513 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:46,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:46,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:46,553 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:46,554 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:46,557 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:46,557 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,588 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:46,591 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:47:46,592 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:109 [2021-06-05 21:47:46,711 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_746, v_prenex_748, array_0, v_prenex_750], 1=[v_prenex_747, v_prenex_749, array_2, v_prenex_751]} [2021-06-05 21:47:46,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:46,717 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:46,722 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,818 INFO L628 ElimStorePlain]: treesize reduction 85, result has 64.3 percent of original size [2021-06-05 21:47:46,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:46,823 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:46,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:46,865 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,903 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:46,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 21:47:46,908 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 21:47:46,912 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:46,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:46,947 INFO L388 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 21 treesize of output 13 [2021-06-05 21:47:46,948 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:46,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:46,980 INFO L518 ElimStorePlain]: Eliminatee v_prenex_749 vanished before elimination [2021-06-05 21:47:46,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:46,983 INFO L388 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 [2021-06-05 21:47:46,984 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:47,015 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:47,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:47,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:47,019 INFO L388 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 [2021-06-05 21:47:47,020 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:47,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:47,024 INFO L388 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 12 treesize of output 8 [2021-06-05 21:47:47,025 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:47,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:47,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:47,057 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:255, output treesize:48 [2021-06-05 21:47:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:47,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854919325] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:47,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:47,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 21:47:47,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500515614] [2021-06-05 21:47:47,118 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:47:47,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:47:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:47:47,118 INFO L87 Difference]: Start difference. First operand 421 states and 1376 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:47,497 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2021-06-05 21:47:47,747 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 107 [2021-06-05 21:47:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:48,077 INFO L93 Difference]: Finished difference Result 576 states and 1834 transitions. [2021-06-05 21:47:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 21:47:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:48,078 INFO L225 Difference]: With dead ends: 576 [2021-06-05 21:47:48,078 INFO L226 Difference]: Without dead ends: 565 [2021-06-05 21:47:48,079 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1040.4ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:47:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-06-05 21:47:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 421. [2021-06-05 21:47:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.276190476190476) internal successors, (1376), 420 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1376 transitions. [2021-06-05 21:47:48,084 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1376 transitions. Word has length 17 [2021-06-05 21:47:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:48,084 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1376 transitions. [2021-06-05 21:47:48,084 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1376 transitions. [2021-06-05 21:47:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:48,084 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:48,084 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:48,300 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2592,244 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:48,301 INFO L430 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:48,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2073250540, now seen corresponding path program 98 times [2021-06-05 21:47:48,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:48,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308909627] [2021-06-05 21:47:48,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:48,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:48,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308909627] [2021-06-05 21:47:48,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308909627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:48,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848451835] [2021-06-05 21:47:48,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:48,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:47:48,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:48,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:47:48,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:48,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:48,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:48,892 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:48,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:48,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:48,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:48,897 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:48,898 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:48,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:48,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:48,902 INFO L388 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 11 [2021-06-05 21:47:48,903 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:48,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:48,906 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:48,907 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:48,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:48,960 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:48,961 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:162 [2021-06-05 21:47:49,069 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_756, array_0, v_prenex_752, v_prenex_754], 1=[v_prenex_757, array_4, v_prenex_753, v_prenex_755]} [2021-06-05 21:47:49,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:47:49,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:49,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:49,079 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:49,228 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-06-05 21:47:49,229 INFO L628 ElimStorePlain]: treesize reduction 150, result has 57.3 percent of original size [2021-06-05 21:47:49,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:47:49,233 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:49,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:49,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 21:47:49,298 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:49,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 21:47:49,302 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:49,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:49,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:49,362 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:49,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:49,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:49,420 INFO L388 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 [2021-06-05 21:47:49,421 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:49,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:49,474 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:47:49,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:49,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:49,478 INFO L388 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 10 treesize of output 6 [2021-06-05 21:47:49,479 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:49,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:49,482 INFO L388 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 24 treesize of output 16 [2021-06-05 21:47:49,483 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:49,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:49,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:49,537 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:49,538 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:49,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:49,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:49,587 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:371, output treesize:127 [2021-06-05 21:47:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:49,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848451835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:49,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:49,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:47:49,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230942695] [2021-06-05 21:47:49,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:47:49,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:47:49,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:47:49,748 INFO L87 Difference]: Start difference. First operand 421 states and 1376 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:50,334 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2021-06-05 21:47:50,607 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 77 [2021-06-05 21:47:50,754 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 21:47:50,935 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2021-06-05 21:47:51,332 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 71 [2021-06-05 21:47:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:51,422 INFO L93 Difference]: Finished difference Result 625 states and 1960 transitions. [2021-06-05 21:47:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:47:51,422 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:51,423 INFO L225 Difference]: With dead ends: 625 [2021-06-05 21:47:51,423 INFO L226 Difference]: Without dead ends: 593 [2021-06-05 21:47:51,423 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1968.2ms TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:47:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-06-05 21:47:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 428. [2021-06-05 21:47:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 3.2740046838407495) internal successors, (1398), 427 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1398 transitions. [2021-06-05 21:47:51,429 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1398 transitions. Word has length 17 [2021-06-05 21:47:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:51,429 INFO L482 AbstractCegarLoop]: Abstraction has 428 states and 1398 transitions. [2021-06-05 21:47:51,429 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1398 transitions. [2021-06-05 21:47:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:51,430 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:51,430 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:51,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 245 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2617 [2021-06-05 21:47:51,645 INFO L430 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1879133244, now seen corresponding path program 99 times [2021-06-05 21:47:51,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:51,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425723281] [2021-06-05 21:47:51,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:51,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:51,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425723281] [2021-06-05 21:47:51,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425723281] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:51,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862537673] [2021-06-05 21:47:51,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:51,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 21:47:51,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:51,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 21:47:51,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:52,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,080 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:52,081 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,085 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:52,085 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,089 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:52,090 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,094 INFO L388 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 11 [2021-06-05 21:47:52,095 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:52,163 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:52,163 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:233, output treesize:199 [2021-06-05 21:47:52,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,295 INFO L388 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 29 treesize of output 23 [2021-06-05 21:47:52,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,300 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:52,301 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,305 INFO L388 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 27 treesize of output 21 [2021-06-05 21:47:52,306 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,310 INFO L388 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 39 treesize of output 31 [2021-06-05 21:47:52,311 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,316 INFO L388 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 11 [2021-06-05 21:47:52,316 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,321 INFO L388 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 17 treesize of output 13 [2021-06-05 21:47:52,322 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,326 INFO L388 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 35 treesize of output 27 [2021-06-05 21:47:52,326 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,330 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:52,331 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,527 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2021-06-05 21:47:52,528 INFO L628 ElimStorePlain]: treesize reduction 172, result has 58.5 percent of original size [2021-06-05 21:47:52,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,532 INFO L388 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 24 treesize of output 16 [2021-06-05 21:47:52,533 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,536 INFO L388 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 22 treesize of output 14 [2021-06-05 21:47:52,537 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,541 INFO L388 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 21 treesize of output 13 [2021-06-05 21:47:52,542 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:52,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:52,545 INFO L388 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 [2021-06-05 21:47:52,546 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:52,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:52,630 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:47:52,630 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:485, output treesize:197 [2021-06-05 21:47:52,892 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2021-06-05 21:47:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:53,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862537673] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:53,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:53,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 21:47:53,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283967556] [2021-06-05 21:47:53,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:47:53,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:47:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:47:53,001 INFO L87 Difference]: Start difference. First operand 428 states and 1398 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:53,320 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2021-06-05 21:47:53,518 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-06-05 21:47:53,820 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-05 21:47:53,946 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2021-06-05 21:47:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:54,085 INFO L93 Difference]: Finished difference Result 604 states and 1916 transitions. [2021-06-05 21:47:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:47:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:54,086 INFO L225 Difference]: With dead ends: 604 [2021-06-05 21:47:54,086 INFO L226 Difference]: Without dead ends: 589 [2021-06-05 21:47:54,086 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1548.3ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:47:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-06-05 21:47:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 429. [2021-06-05 21:47:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.2873831775700935) internal successors, (1407), 428 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1407 transitions. [2021-06-05 21:47:54,092 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1407 transitions. Word has length 17 [2021-06-05 21:47:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:54,092 INFO L482 AbstractCegarLoop]: Abstraction has 429 states and 1407 transitions. [2021-06-05 21:47:54,092 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1407 transitions. [2021-06-05 21:47:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 21:47:54,092 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:54,092 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:54,293 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2632,246 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:54,293 INFO L430 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 309049932, now seen corresponding path program 100 times [2021-06-05 21:47:54,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:54,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824067038] [2021-06-05 21:47:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:54,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:54,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824067038] [2021-06-05 21:47:54,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824067038] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:54,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034699217] [2021-06-05 21:47:54,565 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:54,591 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:47:54,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:54,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:47:54,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:54,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:54,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:54,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:54,668 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:54,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:54,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:47:54,689 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:54,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:47:54,692 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:54,707 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:54,708 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:54,708 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:64 [2021-06-05 21:47:54,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 21:47:54,797 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:54,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:54,801 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:54,834 INFO L628 ElimStorePlain]: treesize reduction 40, result has 64.3 percent of original size [2021-06-05 21:47:54,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:54,838 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:54,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:54,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:47:54,855 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:54,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:54,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:47:54,872 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:54,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:54,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:54,888 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:54,900 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:54,900 INFO L518 ElimStorePlain]: Eliminatee v_prenex_762 vanished before elimination [2021-06-05 21:47:54,900 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:47:54,901 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 21:47:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:54,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034699217] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:54,943 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:54,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 21:47:54,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258070532] [2021-06-05 21:47:54,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:47:54,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:54,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:47:54,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:47:54,944 INFO L87 Difference]: Start difference. First operand 429 states and 1407 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:55,467 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2021-06-05 21:47:55,660 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2021-06-05 21:47:55,853 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 21:47:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:55,903 INFO L93 Difference]: Finished difference Result 637 states and 2020 transitions. [2021-06-05 21:47:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 21:47:55,903 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 21:47:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:55,904 INFO L225 Difference]: With dead ends: 637 [2021-06-05 21:47:55,904 INFO L226 Difference]: Without dead ends: 623 [2021-06-05 21:47:55,905 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1020.8ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:47:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-06-05 21:47:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 429. [2021-06-05 21:47:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.2873831775700935) internal successors, (1407), 428 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1407 transitions. [2021-06-05 21:47:55,910 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1407 transitions. Word has length 17 [2021-06-05 21:47:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:55,910 INFO L482 AbstractCegarLoop]: Abstraction has 429 states and 1407 transitions. [2021-06-05 21:47:55,910 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1407 transitions. [2021-06-05 21:47:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:47:55,911 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:55,911 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:56,111 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 247 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2652 [2021-06-05 21:47:56,111 INFO L430 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:56,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:56,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1605107838, now seen corresponding path program 101 times [2021-06-05 21:47:56,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:56,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485859058] [2021-06-05 21:47:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:56,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:56,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485859058] [2021-06-05 21:47:56,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485859058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:56,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94439913] [2021-06-05 21:47:56,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:56,458 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:47:56,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:56,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:47:56,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:56,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:56,545 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:56,545 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:56,548 INFO L388 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 11 [2021-06-05 21:47:56,548 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:56,567 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:56,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:47:56,568 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 21:47:56,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:47:56,679 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:56,696 INFO L628 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2021-06-05 21:47:56,696 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:47:56,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:47:56,699 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:56,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:56,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:47:56,707 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:47:56,713 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:56,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:47:56,714 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:16 [2021-06-05 21:47:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:56,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94439913] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:56,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:56,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:47:56,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82381755] [2021-06-05 21:47:56,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:47:56,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:56,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:47:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:47:56,743 INFO L87 Difference]: Start difference. First operand 429 states and 1407 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:57,538 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2021-06-05 21:47:57,753 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2021-06-05 21:47:57,950 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2021-06-05 21:47:58,083 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2021-06-05 21:47:58,247 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2021-06-05 21:47:58,389 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2021-06-05 21:47:58,565 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2021-06-05 21:47:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:58,765 INFO L93 Difference]: Finished difference Result 577 states and 1815 transitions. [2021-06-05 21:47:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 21:47:58,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:47:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:58,766 INFO L225 Difference]: With dead ends: 577 [2021-06-05 21:47:58,766 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 21:47:58,767 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1975.1ms TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 21:47:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 21:47:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 434. [2021-06-05 21:47:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.284064665127021) internal successors, (1422), 433 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1422 transitions. [2021-06-05 21:47:58,772 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1422 transitions. Word has length 18 [2021-06-05 21:47:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:58,772 INFO L482 AbstractCegarLoop]: Abstraction has 434 states and 1422 transitions. [2021-06-05 21:47:58,772 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1422 transitions. [2021-06-05 21:47:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:47:58,772 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:58,772 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:47:58,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 248 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2661 [2021-06-05 21:47:58,973 INFO L430 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:47:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:47:58,973 INFO L82 PathProgramCache]: Analyzing trace with hash -343958516, now seen corresponding path program 102 times [2021-06-05 21:47:58,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:47:58,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682542898] [2021-06-05 21:47:58,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:47:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:47:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:59,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:47:59,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682542898] [2021-06-05 21:47:59,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682542898] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:59,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199875806] [2021-06-05 21:47:59,186 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:47:59,214 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:47:59,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:47:59,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:47:59,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:47:59,324 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:47:59,324 INFO L388 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 25 treesize of output 19 [2021-06-05 21:47:59,325 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:59,328 INFO L388 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 11 [2021-06-05 21:47:59,328 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:59,351 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:59,352 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:47:59,352 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 21:47:59,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:47:59,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:47:59,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:47:59,444 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:47:59,444 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:47:59,444 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:47:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:47:59,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199875806] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:47:59,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:47:59,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:47:59,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388075530] [2021-06-05 21:47:59,471 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:47:59,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:47:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:47:59,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:47:59,471 INFO L87 Difference]: Start difference. First operand 434 states and 1422 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:47:59,934 INFO L93 Difference]: Finished difference Result 506 states and 1618 transitions. [2021-06-05 21:47:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:47:59,935 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:47:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:47:59,936 INFO L225 Difference]: With dead ends: 506 [2021-06-05 21:47:59,936 INFO L226 Difference]: Without dead ends: 501 [2021-06-05 21:47:59,936 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 552.9ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:47:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-06-05 21:47:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 440. [2021-06-05 21:47:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.287015945330296) internal successors, (1443), 439 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1443 transitions. [2021-06-05 21:47:59,941 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1443 transitions. Word has length 18 [2021-06-05 21:47:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:47:59,941 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1443 transitions. [2021-06-05 21:47:59,941 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:47:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1443 transitions. [2021-06-05 21:47:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:47:59,941 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:47:59,941 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:00,142 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2670,249 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:00,142 INFO L430 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2011020034, now seen corresponding path program 103 times [2021-06-05 21:48:00,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:00,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361952190] [2021-06-05 21:48:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:00,421 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:00,421 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361952190] [2021-06-05 21:48:00,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361952190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:00,421 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930442048] [2021-06-05 21:48:00,421 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:00,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 21:48:00,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:00,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:00,578 INFO L388 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 11 [2021-06-05 21:48:00,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:00,583 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:00,584 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:00,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:00,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:00,611 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 21:48:00,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:00,676 INFO L388 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 11 [2021-06-05 21:48:00,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:00,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:00,680 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:00,681 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:00,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:00,684 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:00,685 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:00,687 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:00,688 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:00,748 INFO L628 ElimStorePlain]: treesize reduction 89, result has 39.5 percent of original size [2021-06-05 21:48:00,750 INFO L388 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 [2021-06-05 21:48:00,752 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:00,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:00,777 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:00,777 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 21:48:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:00,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930442048] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:00,903 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:00,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 21:48:00,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759078414] [2021-06-05 21:48:00,904 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:48:00,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:48:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:00,904 INFO L87 Difference]: Start difference. First operand 440 states and 1443 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:01,467 INFO L93 Difference]: Finished difference Result 516 states and 1643 transitions. [2021-06-05 21:48:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:01,468 INFO L225 Difference]: With dead ends: 516 [2021-06-05 21:48:01,468 INFO L226 Difference]: Without dead ends: 504 [2021-06-05 21:48:01,468 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 718.5ms TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:48:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-06-05 21:48:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 443. [2021-06-05 21:48:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.2850678733031673) internal successors, (1452), 442 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1452 transitions. [2021-06-05 21:48:01,473 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1452 transitions. Word has length 18 [2021-06-05 21:48:01,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:01,473 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1452 transitions. [2021-06-05 21:48:01,473 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1452 transitions. [2021-06-05 21:48:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:01,474 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:01,474 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:01,674 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2680,250 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:01,674 INFO L430 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:01,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1137279354, now seen corresponding path program 104 times [2021-06-05 21:48:01,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:01,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144143088] [2021-06-05 21:48:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:01,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:01,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144143088] [2021-06-05 21:48:01,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144143088] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:01,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593253860] [2021-06-05 21:48:01,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:01,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:01,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:01,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:01,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:02,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:02,024 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:02,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:02,027 INFO L388 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 11 [2021-06-05 21:48:02,028 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:02,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:02,051 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:02,051 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 21:48:02,103 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_765], 1=[array_4, v_prenex_766]} [2021-06-05 21:48:02,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:02,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:02,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:02,110 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:02,153 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 21:48:02,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:48:02,156 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:02,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:02,172 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:48:02,174 INFO L388 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 22 treesize of output 14 [2021-06-05 21:48:02,174 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:02,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:02,190 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:02,190 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 21:48:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:02,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593253860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:02,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:02,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:02,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640606084] [2021-06-05 21:48:02,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:02,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:02,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:02,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:02,256 INFO L87 Difference]: Start difference. First operand 443 states and 1452 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:03,119 INFO L93 Difference]: Finished difference Result 525 states and 1675 transitions. [2021-06-05 21:48:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:48:03,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:03,120 INFO L225 Difference]: With dead ends: 525 [2021-06-05 21:48:03,120 INFO L226 Difference]: Without dead ends: 515 [2021-06-05 21:48:03,120 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 856.7ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:48:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-06-05 21:48:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 445. [2021-06-05 21:48:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.2882882882882885) internal successors, (1460), 444 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1460 transitions. [2021-06-05 21:48:03,125 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1460 transitions. Word has length 18 [2021-06-05 21:48:03,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:03,125 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1460 transitions. [2021-06-05 21:48:03,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1460 transitions. [2021-06-05 21:48:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:03,125 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:03,126 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:03,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2690,251 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:03,326 INFO L430 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:03,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:03,326 INFO L82 PathProgramCache]: Analyzing trace with hash 193897062, now seen corresponding path program 105 times [2021-06-05 21:48:03,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:03,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749106859] [2021-06-05 21:48:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:03,536 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:03,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749106859] [2021-06-05 21:48:03,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749106859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:03,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961330302] [2021-06-05 21:48:03,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:03,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:48:03,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:03,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:03,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:03,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:03,669 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:03,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:03,672 INFO L388 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 11 [2021-06-05 21:48:03,673 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:03,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:03,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:03,697 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 21:48:03,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:48:03,781 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:03,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:48:03,783 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:03,797 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:48:03,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:48:03,799 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:03,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:03,806 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:03,806 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:48:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:03,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961330302] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:03,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:03,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:03,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163666639] [2021-06-05 21:48:03,832 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:03,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:03,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:03,833 INFO L87 Difference]: Start difference. First operand 445 states and 1460 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:04,306 INFO L93 Difference]: Finished difference Result 529 states and 1688 transitions. [2021-06-05 21:48:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:04,306 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:04,307 INFO L225 Difference]: With dead ends: 529 [2021-06-05 21:48:04,307 INFO L226 Difference]: Without dead ends: 524 [2021-06-05 21:48:04,307 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 552.4ms TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:48:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-06-05 21:48:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 454. [2021-06-05 21:48:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.2891832229580573) internal successors, (1490), 453 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1490 transitions. [2021-06-05 21:48:04,312 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1490 transitions. Word has length 18 [2021-06-05 21:48:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:04,312 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1490 transitions. [2021-06-05 21:48:04,312 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1490 transitions. [2021-06-05 21:48:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:04,313 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:04,313 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:04,513 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 252 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2701 [2021-06-05 21:48:04,513 INFO L430 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1746091684, now seen corresponding path program 106 times [2021-06-05 21:48:04,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:04,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8437819] [2021-06-05 21:48:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:04,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:04,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8437819] [2021-06-05 21:48:04,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8437819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:04,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041557675] [2021-06-05 21:48:04,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:04,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:48:04,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:04,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:48:04,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:04,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:04,929 INFO L388 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 11 [2021-06-05 21:48:04,930 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:04,932 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:04,933 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:04,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:04,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:04,959 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 21:48:05,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:05,034 INFO L388 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 11 [2021-06-05 21:48:05,034 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:05,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:05,037 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:05,038 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:05,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:05,041 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:05,042 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:05,044 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:05,045 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:05,104 INFO L628 ElimStorePlain]: treesize reduction 89, result has 39.5 percent of original size [2021-06-05 21:48:05,106 INFO L388 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 [2021-06-05 21:48:05,121 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:05,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:05,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:05,147 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 21:48:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:05,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041557675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:05,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:05,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 21:48:05,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871098750] [2021-06-05 21:48:05,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:48:05,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:05,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:48:05,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:05,260 INFO L87 Difference]: Start difference. First operand 454 states and 1490 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:05,798 INFO L93 Difference]: Finished difference Result 539 states and 1713 transitions. [2021-06-05 21:48:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:05,798 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:05,799 INFO L225 Difference]: With dead ends: 539 [2021-06-05 21:48:05,799 INFO L226 Difference]: Without dead ends: 527 [2021-06-05 21:48:05,799 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 712.2ms TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:48:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-06-05 21:48:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 451. [2021-06-05 21:48:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.2844444444444445) internal successors, (1478), 450 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1478 transitions. [2021-06-05 21:48:05,804 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1478 transitions. Word has length 18 [2021-06-05 21:48:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:05,805 INFO L482 AbstractCegarLoop]: Abstraction has 451 states and 1478 transitions. [2021-06-05 21:48:05,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1478 transitions. [2021-06-05 21:48:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:05,805 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:05,805 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:06,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 253 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2711 [2021-06-05 21:48:06,006 INFO L430 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:06,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1675134932, now seen corresponding path program 107 times [2021-06-05 21:48:06,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:06,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365697085] [2021-06-05 21:48:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:06,221 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:06,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365697085] [2021-06-05 21:48:06,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365697085] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:06,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259424962] [2021-06-05 21:48:06,221 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:06,250 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:48:06,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:06,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:06,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:06,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:06,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:06,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:06,354 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:06,370 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:06,371 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:06,371 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 21:48:06,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:06,421 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:06,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:06,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:06,424 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:06,425 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:06,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:06,427 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:06,428 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:06,430 INFO L388 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 11 [2021-06-05 21:48:06,431 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:06,469 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 21:48:06,471 INFO L388 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 [2021-06-05 21:48:06,472 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:06,487 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:06,488 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:06,488 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:48:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:06,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259424962] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:06,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:06,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:06,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364549996] [2021-06-05 21:48:06,552 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:06,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:06,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:06,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:06,553 INFO L87 Difference]: Start difference. First operand 451 states and 1478 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:07,126 INFO L93 Difference]: Finished difference Result 534 states and 1710 transitions. [2021-06-05 21:48:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:07,126 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:07,127 INFO L225 Difference]: With dead ends: 534 [2021-06-05 21:48:07,127 INFO L226 Difference]: Without dead ends: 529 [2021-06-05 21:48:07,127 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 603.5ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:48:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-06-05 21:48:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 448. [2021-06-05 21:48:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.286353467561521) internal successors, (1469), 447 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1469 transitions. [2021-06-05 21:48:07,132 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1469 transitions. Word has length 18 [2021-06-05 21:48:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:07,132 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 1469 transitions. [2021-06-05 21:48:07,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1469 transitions. [2021-06-05 21:48:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:07,133 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:07,133 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:07,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2721,254 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:07,333 INFO L430 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1103680126, now seen corresponding path program 108 times [2021-06-05 21:48:07,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:07,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590083921] [2021-06-05 21:48:07,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:07,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:07,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590083921] [2021-06-05 21:48:07,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590083921] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:07,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251047325] [2021-06-05 21:48:07,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:07,598 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:48:07,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:07,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:07,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:07,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:07,679 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:07,680 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:07,682 INFO L388 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 11 [2021-06-05 21:48:07,683 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:07,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:07,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:07,703 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 21:48:07,793 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_767, array_0], 1=[v_prenex_768, array_4]} [2021-06-05 21:48:07,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:07,796 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:07,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:07,800 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:07,842 INFO L628 ElimStorePlain]: treesize reduction 83, result has 39.4 percent of original size [2021-06-05 21:48:07,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:48:07,845 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:07,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:07,861 INFO L518 ElimStorePlain]: Eliminatee v_prenex_768 vanished before elimination [2021-06-05 21:48:07,863 INFO L388 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 22 treesize of output 14 [2021-06-05 21:48:07,863 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:07,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:07,879 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:07,879 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 21:48:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:07,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251047325] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:07,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:07,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:07,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997313215] [2021-06-05 21:48:07,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:07,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:07,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:07,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:07,956 INFO L87 Difference]: Start difference. First operand 448 states and 1469 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:08,542 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-06-05 21:48:08,721 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 21:48:08,852 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-05 21:48:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:08,919 INFO L93 Difference]: Finished difference Result 578 states and 1826 transitions. [2021-06-05 21:48:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:48:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:08,920 INFO L225 Difference]: With dead ends: 578 [2021-06-05 21:48:08,920 INFO L226 Difference]: Without dead ends: 568 [2021-06-05 21:48:08,921 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 955.5ms TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:48:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-06-05 21:48:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 454. [2021-06-05 21:48:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.282560706401766) internal successors, (1487), 453 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1487 transitions. [2021-06-05 21:48:08,926 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1487 transitions. Word has length 18 [2021-06-05 21:48:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:08,926 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1487 transitions. [2021-06-05 21:48:08,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1487 transitions. [2021-06-05 21:48:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:08,927 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:08,927 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:09,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 255 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2731 [2021-06-05 21:48:09,127 INFO L430 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:09,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1529859260, now seen corresponding path program 109 times [2021-06-05 21:48:09,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:09,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986596588] [2021-06-05 21:48:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:09,315 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:09,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986596588] [2021-06-05 21:48:09,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986596588] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:09,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583272180] [2021-06-05 21:48:09,316 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:09,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:48:09,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:09,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:09,442 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:09,443 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:09,445 INFO L388 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 11 [2021-06-05 21:48:09,446 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:09,465 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:09,465 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:09,465 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 21:48:09,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:09,577 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:09,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:09,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:09,586 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:09,587 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:09,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:09,590 INFO L388 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 11 [2021-06-05 21:48:09,591 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:09,593 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:09,594 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:09,634 INFO L628 ElimStorePlain]: treesize reduction 73, result has 38.7 percent of original size [2021-06-05 21:48:09,636 INFO L388 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 [2021-06-05 21:48:09,637 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:09,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:09,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:09,654 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 21:48:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:09,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583272180] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:09,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:09,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 21:48:09,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838321723] [2021-06-05 21:48:09,716 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:48:09,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:48:09,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:09,716 INFO L87 Difference]: Start difference. First operand 454 states and 1487 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:10,962 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-06-05 21:48:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:11,010 INFO L93 Difference]: Finished difference Result 602 states and 1889 transitions. [2021-06-05 21:48:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 21:48:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:11,011 INFO L225 Difference]: With dead ends: 602 [2021-06-05 21:48:11,012 INFO L226 Difference]: Without dead ends: 578 [2021-06-05 21:48:11,012 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1194.2ms TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2021-06-05 21:48:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-06-05 21:48:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 464. [2021-06-05 21:48:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.2764578833693303) internal successors, (1517), 463 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1517 transitions. [2021-06-05 21:48:11,017 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1517 transitions. Word has length 18 [2021-06-05 21:48:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:11,017 INFO L482 AbstractCegarLoop]: Abstraction has 464 states and 1517 transitions. [2021-06-05 21:48:11,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1517 transitions. [2021-06-05 21:48:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:11,018 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:11,018 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:11,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2743,256 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:11,218 INFO L430 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 816041682, now seen corresponding path program 110 times [2021-06-05 21:48:11,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:11,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582809770] [2021-06-05 21:48:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:11,489 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:11,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582809770] [2021-06-05 21:48:11,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582809770] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:11,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134561369] [2021-06-05 21:48:11,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:11,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:11,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:11,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:11,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:11,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:11,639 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:11,640 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:11,643 INFO L388 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 11 [2021-06-05 21:48:11,643 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:11,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:11,666 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:11,666 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 21:48:11,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:48:11,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:11,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:48:11,752 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:11,765 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:48:11,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:48:11,768 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:11,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:11,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:11,775 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:48:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:11,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134561369] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:11,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:11,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:11,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461305948] [2021-06-05 21:48:11,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:11,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:11,802 INFO L87 Difference]: Start difference. First operand 464 states and 1517 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:12,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:12,281 INFO L93 Difference]: Finished difference Result 540 states and 1723 transitions. [2021-06-05 21:48:12,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:12,281 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:12,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:12,282 INFO L225 Difference]: With dead ends: 540 [2021-06-05 21:48:12,282 INFO L226 Difference]: Without dead ends: 535 [2021-06-05 21:48:12,282 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 580.1ms TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:48:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-06-05 21:48:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 470. [2021-06-05 21:48:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.279317697228145) internal successors, (1538), 469 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1538 transitions. [2021-06-05 21:48:12,287 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1538 transitions. Word has length 18 [2021-06-05 21:48:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:12,287 INFO L482 AbstractCegarLoop]: Abstraction has 470 states and 1538 transitions. [2021-06-05 21:48:12,287 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1538 transitions. [2021-06-05 21:48:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:12,287 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:12,288 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:12,492 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 257 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2753 [2021-06-05 21:48:12,493 INFO L430 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1123947064, now seen corresponding path program 111 times [2021-06-05 21:48:12,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:12,493 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186514377] [2021-06-05 21:48:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:12,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:12,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186514377] [2021-06-05 21:48:12,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186514377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:12,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450490315] [2021-06-05 21:48:12,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:12,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:48:12,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:12,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:12,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:12,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:12,888 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:12,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:12,891 INFO L388 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 11 [2021-06-05 21:48:12,892 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:12,914 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:12,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:12,915 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 21:48:12,967 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_769, array_2], 1=[array_4, v_prenex_770]} [2021-06-05 21:48:12,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:48:12,971 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:12,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:12,974 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:13,017 INFO L628 ElimStorePlain]: treesize reduction 75, result has 42.7 percent of original size [2021-06-05 21:48:13,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:13,021 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:13,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:13,036 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:48:13,039 INFO L388 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 22 treesize of output 14 [2021-06-05 21:48:13,039 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:13,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:13,061 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:13,061 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 21:48:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:13,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450490315] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:13,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:13,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:13,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41521272] [2021-06-05 21:48:13,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:13,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:13,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:13,126 INFO L87 Difference]: Start difference. First operand 470 states and 1538 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:13,573 INFO L93 Difference]: Finished difference Result 550 states and 1755 transitions. [2021-06-05 21:48:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:13,575 INFO L225 Difference]: With dead ends: 550 [2021-06-05 21:48:13,575 INFO L226 Difference]: Without dead ends: 545 [2021-06-05 21:48:13,575 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 548.2ms TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:48:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-06-05 21:48:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 464. [2021-06-05 21:48:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.2764578833693303) internal successors, (1517), 463 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1517 transitions. [2021-06-05 21:48:13,580 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1517 transitions. Word has length 18 [2021-06-05 21:48:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:13,580 INFO L482 AbstractCegarLoop]: Abstraction has 464 states and 1517 transitions. [2021-06-05 21:48:13,580 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1517 transitions. [2021-06-05 21:48:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:13,580 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:13,580 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:13,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 258 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2763 [2021-06-05 21:48:13,785 INFO L430 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1997687744, now seen corresponding path program 112 times [2021-06-05 21:48:13,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:13,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974794050] [2021-06-05 21:48:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:14,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:14,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974794050] [2021-06-05 21:48:14,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974794050] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:14,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261143983] [2021-06-05 21:48:14,016 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:14,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:48:14,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:14,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:48:14,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:14,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:14,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:14,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:14,162 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:14,178 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:14,179 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:14,179 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 21:48:14,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:14,235 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:14,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:14,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:14,238 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:14,239 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:14,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:14,242 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:14,243 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:14,246 INFO L388 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 11 [2021-06-05 21:48:14,246 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:14,284 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 21:48:14,286 INFO L388 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 [2021-06-05 21:48:14,288 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:14,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:14,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:14,303 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:48:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:14,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261143983] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:14,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:14,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:14,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555018305] [2021-06-05 21:48:14,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:14,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:14,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:14,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:14,369 INFO L87 Difference]: Start difference. First operand 464 states and 1517 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:15,119 INFO L93 Difference]: Finished difference Result 548 states and 1754 transitions. [2021-06-05 21:48:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:48:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:15,120 INFO L225 Difference]: With dead ends: 548 [2021-06-05 21:48:15,120 INFO L226 Difference]: Without dead ends: 543 [2021-06-05 21:48:15,120 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 794.8ms TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:48:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-06-05 21:48:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 465. [2021-06-05 21:48:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.2780172413793105) internal successors, (1521), 464 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1521 transitions. [2021-06-05 21:48:15,125 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1521 transitions. Word has length 18 [2021-06-05 21:48:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:15,125 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1521 transitions. [2021-06-05 21:48:15,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1521 transitions. [2021-06-05 21:48:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:15,126 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:15,126 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:15,327 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 259 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2774 [2021-06-05 21:48:15,328 INFO L430 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1275381276, now seen corresponding path program 113 times [2021-06-05 21:48:15,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:15,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58924593] [2021-06-05 21:48:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:15,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:15,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58924593] [2021-06-05 21:48:15,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58924593] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:15,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950779155] [2021-06-05 21:48:15,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:15,619 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:15,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:15,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:48:15,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:15,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:15,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:15,687 INFO L388 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 11 [2021-06-05 21:48:15,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:15,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:15,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:15,691 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:15,691 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:15,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:15,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:15,695 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:15,696 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:15,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:15,700 INFO L388 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 12 [2021-06-05 21:48:15,700 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:15,743 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:15,744 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:15,744 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 21:48:16,026 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_2]} [2021-06-05 21:48:16,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:16,030 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:16,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:16,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:16,034 INFO L388 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 11 [2021-06-05 21:48:16,035 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:16,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:16,038 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:16,039 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:16,042 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:16,043 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:16,095 INFO L628 ElimStorePlain]: treesize reduction 81, result has 41.7 percent of original size [2021-06-05 21:48:16,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:16,098 INFO L388 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 [2021-06-05 21:48:16,100 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:16,121 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:16,122 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:16,122 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:173, output treesize:38 [2021-06-05 21:48:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:16,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950779155] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:16,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:16,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 21:48:16,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146856131] [2021-06-05 21:48:16,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:16,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:16,186 INFO L87 Difference]: Start difference. First operand 465 states and 1521 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:16,409 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-06-05 21:48:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:16,867 INFO L93 Difference]: Finished difference Result 633 states and 1928 transitions. [2021-06-05 21:48:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:16,868 INFO L225 Difference]: With dead ends: 633 [2021-06-05 21:48:16,868 INFO L226 Difference]: Without dead ends: 614 [2021-06-05 21:48:16,868 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 917.5ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:48:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-06-05 21:48:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 470. [2021-06-05 21:48:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.275053304904051) internal successors, (1536), 469 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1536 transitions. [2021-06-05 21:48:16,874 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1536 transitions. Word has length 18 [2021-06-05 21:48:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:16,874 INFO L482 AbstractCegarLoop]: Abstraction has 470 states and 1536 transitions. [2021-06-05 21:48:16,875 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1536 transitions. [2021-06-05 21:48:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:16,875 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:16,875 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:17,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2785,260 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:17,076 INFO L430 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:17,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2131877222, now seen corresponding path program 114 times [2021-06-05 21:48:17,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:17,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699813122] [2021-06-05 21:48:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:17,344 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:17,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699813122] [2021-06-05 21:48:17,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699813122] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:17,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435292283] [2021-06-05 21:48:17,344 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:17,372 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:48:17,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:17,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:17,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:17,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:17,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:17,441 INFO L388 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 11 [2021-06-05 21:48:17,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:17,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:17,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:17,445 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:17,445 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:17,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:17,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:17,448 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:17,449 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:17,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:17,452 INFO L388 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 12 [2021-06-05 21:48:17,453 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:17,493 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:17,494 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:17,494 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 21:48:17,781 INFO L446 ElimStorePlain]: Different costs {0=[array_4, v_prenex_780], 1=[v_prenex_779, array_2]} [2021-06-05 21:48:17,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:17,786 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:17,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:17,791 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:17,827 INFO L628 ElimStorePlain]: treesize reduction 63, result has 44.7 percent of original size [2021-06-05 21:48:17,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:48:17,830 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:17,842 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:17,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:17,845 INFO L388 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 22 treesize of output 14 [2021-06-05 21:48:17,846 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:17,857 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:17,857 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:48:17,858 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:17,858 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:132, output treesize:16 [2021-06-05 21:48:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:17,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435292283] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:17,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:17,874 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:48:17,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893410631] [2021-06-05 21:48:17,875 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:48:17,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:48:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:48:17,875 INFO L87 Difference]: Start difference. First operand 470 states and 1536 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:18,466 INFO L93 Difference]: Finished difference Result 615 states and 1900 transitions. [2021-06-05 21:48:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:18,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:18,467 INFO L225 Difference]: With dead ends: 615 [2021-06-05 21:48:18,467 INFO L226 Difference]: Without dead ends: 610 [2021-06-05 21:48:18,467 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 809.0ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-06-05 21:48:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 473. [2021-06-05 21:48:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2796610169491527) internal successors, (1548), 472 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1548 transitions. [2021-06-05 21:48:18,473 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1548 transitions. Word has length 18 [2021-06-05 21:48:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:18,473 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1548 transitions. [2021-06-05 21:48:18,473 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1548 transitions. [2021-06-05 21:48:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:18,474 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:18,474 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:18,674 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 261 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2799 [2021-06-05 21:48:18,674 INFO L430 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash 191888476, now seen corresponding path program 115 times [2021-06-05 21:48:18,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:18,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307572853] [2021-06-05 21:48:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:19,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:19,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307572853] [2021-06-05 21:48:19,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307572853] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:19,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473799372] [2021-06-05 21:48:19,024 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:19,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:48:19,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:19,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,120 INFO L388 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 11 [2021-06-05 21:48:19,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,124 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:19,125 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,128 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:19,129 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,132 INFO L388 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 12 [2021-06-05 21:48:19,132 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,173 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:19,174 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:19,174 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 21:48:19,412 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 21:48:19,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,416 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:19,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,420 INFO L388 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 11 [2021-06-05 21:48:19,421 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,425 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:19,425 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,428 INFO L388 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 35 treesize of output 27 [2021-06-05 21:48:19,429 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,508 INFO L628 ElimStorePlain]: treesize reduction 91, result has 45.5 percent of original size [2021-06-05 21:48:19,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:19,512 INFO L388 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 22 treesize of output 14 [2021-06-05 21:48:19,512 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:19,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:19,543 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:19,543 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:205, output treesize:50 [2021-06-05 21:48:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:19,639 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473799372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:19,639 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:19,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 21:48:19,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790416276] [2021-06-05 21:48:19,640 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:48:19,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:19,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:48:19,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:48:19,640 INFO L87 Difference]: Start difference. First operand 473 states and 1548 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:20,296 INFO L93 Difference]: Finished difference Result 629 states and 1937 transitions. [2021-06-05 21:48:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:20,297 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:20,297 INFO L225 Difference]: With dead ends: 629 [2021-06-05 21:48:20,298 INFO L226 Difference]: Without dead ends: 617 [2021-06-05 21:48:20,298 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 858.0ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-06-05 21:48:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 472. [2021-06-05 21:48:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.26963906581741) internal successors, (1540), 471 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1540 transitions. [2021-06-05 21:48:20,303 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1540 transitions. Word has length 18 [2021-06-05 21:48:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:20,303 INFO L482 AbstractCegarLoop]: Abstraction has 472 states and 1540 transitions. [2021-06-05 21:48:20,303 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1540 transitions. [2021-06-05 21:48:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:20,304 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:20,304 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:20,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2818,262 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:20,505 INFO L430 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:20,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1976445854, now seen corresponding path program 116 times [2021-06-05 21:48:20,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:20,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660588888] [2021-06-05 21:48:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:48:20,576 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:20,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660588888] [2021-06-05 21:48:20,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660588888] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:20,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204508406] [2021-06-05 21:48:20,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:20,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:20,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:20,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 21:48:20,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:20,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:48:20,642 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:20,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:20,645 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:20,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:20,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:48:20,658 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:20,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:20,668 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:20,668 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:21 [2021-06-05 21:48:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:48:20,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204508406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:20,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:20,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 21:48:20,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498068983] [2021-06-05 21:48:20,769 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 21:48:20,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 21:48:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:48:20,769 INFO L87 Difference]: Start difference. First operand 472 states and 1540 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:21,413 INFO L93 Difference]: Finished difference Result 959 states and 2931 transitions. [2021-06-05 21:48:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 21:48:21,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:21,415 INFO L225 Difference]: With dead ends: 959 [2021-06-05 21:48:21,415 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 21:48:21,415 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 551.7ms TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:48:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 21:48:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 546. [2021-06-05 21:48:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.388990825688073) internal successors, (1847), 545 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1847 transitions. [2021-06-05 21:48:21,422 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1847 transitions. Word has length 18 [2021-06-05 21:48:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:21,422 INFO L482 AbstractCegarLoop]: Abstraction has 546 states and 1847 transitions. [2021-06-05 21:48:21,422 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1847 transitions. [2021-06-05 21:48:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:21,423 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:21,423 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:21,623 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2834,263 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:21,623 INFO L430 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2058487706, now seen corresponding path program 117 times [2021-06-05 21:48:21,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:21,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509892334] [2021-06-05 21:48:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:21,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:21,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509892334] [2021-06-05 21:48:21,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509892334] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:21,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55386675] [2021-06-05 21:48:21,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:21,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:48:21,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:21,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:21,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:22,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,046 INFO L388 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 12 [2021-06-05 21:48:22,047 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:22,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,050 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:22,051 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:22,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,054 INFO L388 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 11 [2021-06-05 21:48:22,054 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:22,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,057 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:22,058 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:22,089 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:22,090 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:22,090 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:87 [2021-06-05 21:48:22,367 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 21:48:22,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,371 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:22,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:22,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,375 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:22,375 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:22,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,379 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:22,379 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:22,382 INFO L388 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 11 [2021-06-05 21:48:22,383 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:22,439 INFO L628 ElimStorePlain]: treesize reduction 82, result has 40.1 percent of original size [2021-06-05 21:48:22,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:22,442 INFO L388 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 [2021-06-05 21:48:22,452 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:22,479 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:22,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:22,481 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 21:48:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:22,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55386675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:22,553 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:22,553 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:48:22,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572644473] [2021-06-05 21:48:22,553 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:48:22,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:48:22,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:48:22,553 INFO L87 Difference]: Start difference. First operand 546 states and 1847 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:22,964 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 21:48:23,288 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-06-05 21:48:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:23,655 INFO L93 Difference]: Finished difference Result 669 states and 2169 transitions. [2021-06-05 21:48:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:48:23,655 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:23,657 INFO L225 Difference]: With dead ends: 669 [2021-06-05 21:48:23,657 INFO L226 Difference]: Without dead ends: 664 [2021-06-05 21:48:23,657 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1234.3ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:48:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-06-05 21:48:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 544. [2021-06-05 21:48:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.394106813996317) internal successors, (1843), 543 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1843 transitions. [2021-06-05 21:48:23,663 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1843 transitions. Word has length 18 [2021-06-05 21:48:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:23,663 INFO L482 AbstractCegarLoop]: Abstraction has 544 states and 1843 transitions. [2021-06-05 21:48:23,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1843 transitions. [2021-06-05 21:48:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:23,664 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:23,664 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:23,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 264 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2841 [2021-06-05 21:48:23,864 INFO L430 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -264932768, now seen corresponding path program 118 times [2021-06-05 21:48:23,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:23,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196812995] [2021-06-05 21:48:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:23,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:23,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196812995] [2021-06-05 21:48:23,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196812995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:23,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983624717] [2021-06-05 21:48:23,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:23,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:48:23,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:23,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:48:23,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:24,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:24,034 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:24,035 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:24,038 INFO L388 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 12 [2021-06-05 21:48:24,038 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:24,041 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:24,042 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,044 INFO L388 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 11 [2021-06-05 21:48:24,045 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:24,072 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:24,072 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:75 [2021-06-05 21:48:24,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:24,166 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:24,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:24,170 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:24,173 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:48:24,176 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:24,180 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,182 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:48:24,182 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,184 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:48:24,185 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,186 INFO L388 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 12 [2021-06-05 21:48:24,187 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:24,215 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 21:48:24,215 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:48:24,216 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:24,216 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 21:48:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:24,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983624717] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:24,251 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:24,251 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 21:48:24,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663777267] [2021-06-05 21:48:24,251 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:48:24,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:48:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:48:24,252 INFO L87 Difference]: Start difference. First operand 544 states and 1843 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:25,829 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2021-06-05 21:48:25,976 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2021-06-05 21:48:26,744 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 21:48:26,875 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2021-06-05 21:48:27,028 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-06-05 21:48:27,639 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 21:48:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:27,906 INFO L93 Difference]: Finished difference Result 1295 states and 3899 transitions. [2021-06-05 21:48:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 21:48:27,906 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:27,908 INFO L225 Difference]: With dead ends: 1295 [2021-06-05 21:48:27,908 INFO L226 Difference]: Without dead ends: 1202 [2021-06-05 21:48:27,908 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 3018.5ms TimeCoverageRelationStatistics Valid=603, Invalid=2477, Unknown=0, NotChecked=0, Total=3080 [2021-06-05 21:48:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-06-05 21:48:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 636. [2021-06-05 21:48:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 21:48:27,918 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 21:48:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:27,918 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 21:48:27,918 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 21:48:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:27,918 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:27,919 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:28,119 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2858,265 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:28,119 INFO L430 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1095578010, now seen corresponding path program 119 times [2021-06-05 21:48:28,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:28,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316544963] [2021-06-05 21:48:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:28,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:28,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316544963] [2021-06-05 21:48:28,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316544963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:28,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096928146] [2021-06-05 21:48:28,327 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:28,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:28,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:28,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:28,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:28,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:28,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:28,512 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:28,513 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:28,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:28,516 INFO L388 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 11 [2021-06-05 21:48:28,517 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:28,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:28,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:48:28,550 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-06-05 21:48:28,690 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_790, array_4], 1=[v_prenex_789, array_2]} [2021-06-05 21:48:28,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:28,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:28,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:28,697 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:28,734 INFO L628 ElimStorePlain]: treesize reduction 67, result has 43.2 percent of original size [2021-06-05 21:48:28,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:48:28,737 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:28,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:28,749 INFO L518 ElimStorePlain]: Eliminatee v_prenex_789 vanished before elimination [2021-06-05 21:48:28,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:28,752 INFO L388 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 22 treesize of output 14 [2021-06-05 21:48:28,752 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:28,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:28,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:28,765 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:132, output treesize:16 [2021-06-05 21:48:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:28,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096928146] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:28,781 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:28,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:48:28,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829378123] [2021-06-05 21:48:28,781 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:48:28,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:28,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:48:28,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:48:28,782 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:29,152 INFO L93 Difference]: Finished difference Result 730 states and 2543 transitions. [2021-06-05 21:48:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:29,152 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:29,153 INFO L225 Difference]: With dead ends: 730 [2021-06-05 21:48:29,153 INFO L226 Difference]: Without dead ends: 725 [2021-06-05 21:48:29,154 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 428.4ms TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:48:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-06-05 21:48:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 642. [2021-06-05 21:48:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.5709828393135727) internal successors, (2289), 641 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2289 transitions. [2021-06-05 21:48:29,161 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2289 transitions. Word has length 18 [2021-06-05 21:48:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:29,161 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2289 transitions. [2021-06-05 21:48:29,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2289 transitions. [2021-06-05 21:48:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:29,162 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:29,162 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:29,362 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 266 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2869 [2021-06-05 21:48:29,362 INFO L430 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:29,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1259400540, now seen corresponding path program 120 times [2021-06-05 21:48:29,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:29,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449323376] [2021-06-05 21:48:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:29,524 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:29,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449323376] [2021-06-05 21:48:29,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449323376] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:29,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398183918] [2021-06-05 21:48:29,524 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:29,552 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:48:29,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:29,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:29,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:29,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:29,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:29,739 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:29,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:29,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:29,742 INFO L388 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 11 [2021-06-05 21:48:29,743 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:29,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:29,776 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:48:29,776 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-06-05 21:48:29,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:29,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:29,854 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:29,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:29,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:29,859 INFO L388 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 11 [2021-06-05 21:48:29,859 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:29,919 INFO L628 ElimStorePlain]: treesize reduction 95, result has 41.0 percent of original size [2021-06-05 21:48:29,920 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:48:29,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:29,922 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:29,923 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:29,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:29,946 INFO L388 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 [2021-06-05 21:48:29,947 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:29,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:29,968 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:29,968 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 21:48:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:30,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398183918] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:30,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:30,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:48:30,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637280390] [2021-06-05 21:48:30,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:48:30,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:30,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:48:30,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:48:30,021 INFO L87 Difference]: Start difference. First operand 642 states and 2289 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:30,389 INFO L93 Difference]: Finished difference Result 740 states and 2575 transitions. [2021-06-05 21:48:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:30,390 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:30,391 INFO L225 Difference]: With dead ends: 740 [2021-06-05 21:48:30,391 INFO L226 Difference]: Without dead ends: 735 [2021-06-05 21:48:30,391 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 384.4ms TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:48:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-06-05 21:48:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 636. [2021-06-05 21:48:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 21:48:30,398 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 21:48:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:30,398 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 21:48:30,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 21:48:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:30,399 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:30,399 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:30,599 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2886,267 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:30,599 INFO L430 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash 385659860, now seen corresponding path program 121 times [2021-06-05 21:48:30,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:30,600 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057961474] [2021-06-05 21:48:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:30,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:30,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057961474] [2021-06-05 21:48:30,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057961474] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:30,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30169964] [2021-06-05 21:48:30,791 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:30,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:30,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:30,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:30,959 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:30,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:30,962 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:30,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:30,979 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:30,979 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 21:48:31,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:31,029 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:31,030 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:31,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:31,033 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:31,034 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:31,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:31,036 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:31,037 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:31,039 INFO L388 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 11 [2021-06-05 21:48:31,040 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:31,080 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 21:48:31,083 INFO L388 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 22 treesize of output 14 [2021-06-05 21:48:31,084 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:31,099 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:31,099 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:31,099 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:48:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:31,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30169964] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:31,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:31,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:31,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350758763] [2021-06-05 21:48:31,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:31,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:31,166 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:31,911 INFO L93 Difference]: Finished difference Result 735 states and 2565 transitions. [2021-06-05 21:48:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:31,911 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:31,912 INFO L225 Difference]: With dead ends: 735 [2021-06-05 21:48:31,912 INFO L226 Difference]: Without dead ends: 730 [2021-06-05 21:48:31,912 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 755.1ms TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:48:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-06-05 21:48:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 636. [2021-06-05 21:48:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 21:48:31,919 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 21:48:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:31,919 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 21:48:31,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 21:48:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:31,920 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:31,920 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:32,120 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2903,268 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:32,121 INFO L430 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:32,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:32,121 INFO L82 PathProgramCache]: Analyzing trace with hash 934576270, now seen corresponding path program 122 times [2021-06-05 21:48:32,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:32,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941293942] [2021-06-05 21:48:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:32,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:32,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941293942] [2021-06-05 21:48:32,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941293942] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:32,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308445739] [2021-06-05 21:48:32,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:32,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:32,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:32,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:32,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:32,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:32,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:32,498 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:32,499 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:32,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:32,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:32,505 INFO L388 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 12 [2021-06-05 21:48:32,506 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:32,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:32,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:32,511 INFO L388 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 11 [2021-06-05 21:48:32,512 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:32,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:32,516 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:32,517 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:32,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:32,574 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:32,574 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 21:48:32,867 INFO L446 ElimStorePlain]: Different costs {0=[array_4, v_prenex_798], 1=[array_2, v_prenex_797]} [2021-06-05 21:48:32,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:48:32,873 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:32,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:48:32,877 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:32,919 INFO L628 ElimStorePlain]: treesize reduction 65, result has 42.5 percent of original size [2021-06-05 21:48:32,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:32,922 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:32,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:32,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:32,936 INFO L388 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 12 treesize of output 8 [2021-06-05 21:48:32,937 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:32,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:32,948 INFO L518 ElimStorePlain]: Eliminatee v_prenex_797 vanished before elimination [2021-06-05 21:48:32,950 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:32,950 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 21:48:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:32,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308445739] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:32,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:32,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:48:32,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645222970] [2021-06-05 21:48:32,966 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:48:32,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:32,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:48:32,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:48:32,967 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:33,246 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2021-06-05 21:48:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:33,461 INFO L93 Difference]: Finished difference Result 733 states and 2549 transitions. [2021-06-05 21:48:33,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:33,461 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:33,462 INFO L225 Difference]: With dead ends: 733 [2021-06-05 21:48:33,462 INFO L226 Difference]: Without dead ends: 728 [2021-06-05 21:48:33,462 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 723.3ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2021-06-05 21:48:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 640. [2021-06-05 21:48:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 3.575899843505477) internal successors, (2285), 639 states have internal predecessors, (2285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 2285 transitions. [2021-06-05 21:48:33,470 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 2285 transitions. Word has length 18 [2021-06-05 21:48:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:33,470 INFO L482 AbstractCegarLoop]: Abstraction has 640 states and 2285 transitions. [2021-06-05 21:48:33,470 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 2285 transitions. [2021-06-05 21:48:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:33,471 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:33,471 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:33,671 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 269 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2913 [2021-06-05 21:48:33,672 INFO L430 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:33,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1005412476, now seen corresponding path program 123 times [2021-06-05 21:48:33,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:33,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518191615] [2021-06-05 21:48:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:33,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:33,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518191615] [2021-06-05 21:48:33,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518191615] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:33,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121769243] [2021-06-05 21:48:33,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:33,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:48:33,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:33,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:33,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:34,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,051 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:34,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:34,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,055 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:34,056 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:34,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,059 INFO L388 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 11 [2021-06-05 21:48:34,060 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:34,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,063 INFO L388 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 12 [2021-06-05 21:48:34,064 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:34,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:34,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:34,107 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 21:48:34,304 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 21:48:34,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,308 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:34,309 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:34,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,313 INFO L388 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 35 treesize of output 27 [2021-06-05 21:48:34,313 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:34,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,317 INFO L388 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 11 [2021-06-05 21:48:34,318 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:34,321 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:34,321 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:34,375 INFO L628 ElimStorePlain]: treesize reduction 90, result has 37.9 percent of original size [2021-06-05 21:48:34,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:34,378 INFO L388 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 [2021-06-05 21:48:34,379 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:34,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:34,400 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:34,400 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 21:48:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:34,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121769243] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:34,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:34,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:48:34,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240824978] [2021-06-05 21:48:34,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:48:34,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:48:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:48:34,456 INFO L87 Difference]: Start difference. First operand 640 states and 2285 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:34,755 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-06-05 21:48:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:35,135 INFO L93 Difference]: Finished difference Result 749 states and 2603 transitions. [2021-06-05 21:48:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:35,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:35,137 INFO L225 Difference]: With dead ends: 749 [2021-06-05 21:48:35,137 INFO L226 Difference]: Without dead ends: 744 [2021-06-05 21:48:35,137 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 788.0ms TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-06-05 21:48:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 635. [2021-06-05 21:48:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 3.5709779179810726) internal successors, (2264), 634 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 2264 transitions. [2021-06-05 21:48:35,144 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 2264 transitions. Word has length 18 [2021-06-05 21:48:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:35,144 INFO L482 AbstractCegarLoop]: Abstraction has 635 states and 2264 transitions. [2021-06-05 21:48:35,144 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 2264 transitions. [2021-06-05 21:48:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:35,145 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:35,145 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:35,345 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2932,270 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:35,345 INFO L430 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1141669252, now seen corresponding path program 124 times [2021-06-05 21:48:35,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:35,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569541635] [2021-06-05 21:48:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:35,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:35,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569541635] [2021-06-05 21:48:35,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569541635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:35,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165449368] [2021-06-05 21:48:35,570 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:35,598 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:48:35,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:35,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 21:48:35,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:35,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:35,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:35,704 INFO L388 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 11 [2021-06-05 21:48:35,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:35,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:35,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:35,709 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:35,710 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:35,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:35,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:35,713 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:35,714 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:35,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:35,718 INFO L388 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 12 [2021-06-05 21:48:35,718 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:35,783 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:35,784 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:35,785 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:157 [2021-06-05 21:48:36,033 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 21:48:36,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:36,036 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:36,037 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:36,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:36,041 INFO L388 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 11 [2021-06-05 21:48:36,042 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:36,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:36,045 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:36,046 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:36,049 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:36,050 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:36,128 INFO L628 ElimStorePlain]: treesize reduction 91, result has 43.5 percent of original size [2021-06-05 21:48:36,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:36,131 INFO L388 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 [2021-06-05 21:48:36,133 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:36,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:36,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:36,164 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:197, output treesize:50 [2021-06-05 21:48:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:36,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165449368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:36,263 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:36,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 21:48:36,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020910143] [2021-06-05 21:48:36,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:48:36,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:36,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:48:36,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:48:36,263 INFO L87 Difference]: Start difference. First operand 635 states and 2264 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:36,572 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2021-06-05 21:48:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:36,790 INFO L93 Difference]: Finished difference Result 739 states and 2574 transitions. [2021-06-05 21:48:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:36,790 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:36,792 INFO L225 Difference]: With dead ends: 739 [2021-06-05 21:48:36,792 INFO L226 Difference]: Without dead ends: 726 [2021-06-05 21:48:36,792 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 766.9ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:48:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-06-05 21:48:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 642. [2021-06-05 21:48:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 21:48:36,799 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 21:48:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:36,799 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 21:48:36,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 21:48:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:36,800 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:36,800 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:37,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2949,271 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:37,000 INFO L430 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1750500672, now seen corresponding path program 125 times [2021-06-05 21:48:37,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:37,000 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051695941] [2021-06-05 21:48:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:37,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:37,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051695941] [2021-06-05 21:48:37,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051695941] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:37,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772439121] [2021-06-05 21:48:37,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:37,273 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:48:37,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:37,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:37,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:37,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:37,384 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:37,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:37,387 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:37,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:37,404 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:37,404 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 21:48:37,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:37,455 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:37,456 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:37,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:37,459 INFO L388 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 35 treesize of output 27 [2021-06-05 21:48:37,460 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:37,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:37,463 INFO L388 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 11 [2021-06-05 21:48:37,464 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:37,466 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:37,467 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:37,505 INFO L628 ElimStorePlain]: treesize reduction 78, result has 35.5 percent of original size [2021-06-05 21:48:37,507 INFO L388 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 [2021-06-05 21:48:37,509 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:37,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:37,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:37,525 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:48:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:37,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772439121] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:37,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:37,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:37,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547596945] [2021-06-05 21:48:37,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:37,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:37,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:37,592 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:38,390 INFO L93 Difference]: Finished difference Result 769 states and 2676 transitions. [2021-06-05 21:48:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:48:38,391 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:38,392 INFO L225 Difference]: With dead ends: 769 [2021-06-05 21:48:38,392 INFO L226 Difference]: Without dead ends: 764 [2021-06-05 21:48:38,392 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 814.2ms TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:48:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-06-05 21:48:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 642. [2021-06-05 21:48:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 21:48:38,400 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 21:48:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:38,400 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 21:48:38,400 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 21:48:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:38,401 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:38,401 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:38,601 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2965,272 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:38,601 INFO L430 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:38,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:38,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1973011818, now seen corresponding path program 126 times [2021-06-05 21:48:38,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:38,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57912924] [2021-06-05 21:48:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:38,805 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:38,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57912924] [2021-06-05 21:48:38,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57912924] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:38,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194319708] [2021-06-05 21:48:38,805 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:38,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:48:38,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:38,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:38,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:38,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:38,925 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:38,926 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:38,929 INFO L388 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 11 [2021-06-05 21:48:38,929 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:38,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:38,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:38,949 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 21:48:39,045 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_805], 1=[v_prenex_806, array_4]} [2021-06-05 21:48:39,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:39,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:39,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:39,052 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:39,097 INFO L628 ElimStorePlain]: treesize reduction 75, result has 41.9 percent of original size [2021-06-05 21:48:39,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:48:39,100 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:39,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:39,135 INFO L388 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 [2021-06-05 21:48:39,137 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:39,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:39,152 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:48:39,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:39,153 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 21:48:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:39,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194319708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:39,227 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:39,227 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:39,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32513757] [2021-06-05 21:48:39,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:39,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:39,227 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:40,150 INFO L93 Difference]: Finished difference Result 826 states and 2842 transitions. [2021-06-05 21:48:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:48:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:40,152 INFO L225 Difference]: With dead ends: 826 [2021-06-05 21:48:40,152 INFO L226 Difference]: Without dead ends: 816 [2021-06-05 21:48:40,152 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 876.6ms TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:48:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-06-05 21:48:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 642. [2021-06-05 21:48:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 21:48:40,160 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 21:48:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:40,160 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 21:48:40,160 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 21:48:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:40,161 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:40,161 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:40,361 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 273 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2975 [2021-06-05 21:48:40,361 INFO L430 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:40,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash -881797318, now seen corresponding path program 127 times [2021-06-05 21:48:40,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:40,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686612557] [2021-06-05 21:48:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:40,593 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:40,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686612557] [2021-06-05 21:48:40,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686612557] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:40,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628226261] [2021-06-05 21:48:40,593 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:40,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:48:40,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:40,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:40,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:40,771 INFO L388 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 11 [2021-06-05 21:48:40,772 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:40,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:40,774 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:40,775 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:40,799 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:40,801 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:48:40,801 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:66 [2021-06-05 21:48:40,871 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 21:48:40,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:40,875 INFO L388 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 11 [2021-06-05 21:48:40,876 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:40,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:40,879 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:40,880 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:40,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:40,884 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:40,885 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:40,888 INFO L388 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 35 treesize of output 27 [2021-06-05 21:48:40,889 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:40,937 INFO L628 ElimStorePlain]: treesize reduction 86, result has 39.0 percent of original size [2021-06-05 21:48:40,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:40,940 INFO L388 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 [2021-06-05 21:48:40,942 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:40,961 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:40,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:40,963 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 21:48:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:41,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628226261] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:41,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:41,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 21:48:41,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248581349] [2021-06-05 21:48:41,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:41,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:41,032 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:41,661 INFO L93 Difference]: Finished difference Result 738 states and 2579 transitions. [2021-06-05 21:48:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:41,663 INFO L225 Difference]: With dead ends: 738 [2021-06-05 21:48:41,663 INFO L226 Difference]: Without dead ends: 733 [2021-06-05 21:48:41,663 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 654.8ms TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:48:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-06-05 21:48:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 639. [2021-06-05 21:48:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 3.5768025078369905) internal successors, (2282), 638 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2282 transitions. [2021-06-05 21:48:41,670 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2282 transitions. Word has length 18 [2021-06-05 21:48:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:41,670 INFO L482 AbstractCegarLoop]: Abstraction has 639 states and 2282 transitions. [2021-06-05 21:48:41,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2282 transitions. [2021-06-05 21:48:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:41,671 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:41,671 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:41,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2989,274 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:41,880 INFO L430 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash -125787926, now seen corresponding path program 128 times [2021-06-05 21:48:41,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:41,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255665379] [2021-06-05 21:48:41,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:42,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:42,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255665379] [2021-06-05 21:48:42,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255665379] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:42,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308504979] [2021-06-05 21:48:42,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:42,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:42,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:42,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:42,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:42,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,271 INFO L388 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 12 [2021-06-05 21:48:42,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,276 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:42,277 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,280 INFO L388 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 11 [2021-06-05 21:48:42,281 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,284 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:42,285 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:42,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:42,330 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:119 [2021-06-05 21:48:42,524 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 21:48:42,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,528 INFO L388 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 11 [2021-06-05 21:48:42,529 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,533 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:42,534 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,537 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:42,538 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,542 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:42,543 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,599 INFO L628 ElimStorePlain]: treesize reduction 76, result has 44.5 percent of original size [2021-06-05 21:48:42,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:42,602 INFO L388 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 22 treesize of output 14 [2021-06-05 21:48:42,603 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:42,622 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:42,623 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:42,623 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 21:48:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:42,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308504979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:42,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:42,689 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:48:42,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606396066] [2021-06-05 21:48:42,689 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:48:42,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:48:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:48:42,689 INFO L87 Difference]: Start difference. First operand 639 states and 2282 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:42,965 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2021-06-05 21:48:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:43,203 INFO L93 Difference]: Finished difference Result 740 states and 2591 transitions. [2021-06-05 21:48:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:43,204 INFO L225 Difference]: With dead ends: 740 [2021-06-05 21:48:43,205 INFO L226 Difference]: Without dead ends: 735 [2021-06-05 21:48:43,205 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 743.5ms TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-06-05 21:48:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 641. [2021-06-05 21:48:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 3.5796875) internal successors, (2291), 640 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 2291 transitions. [2021-06-05 21:48:43,212 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 2291 transitions. Word has length 18 [2021-06-05 21:48:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:43,212 INFO L482 AbstractCegarLoop]: Abstraction has 641 states and 2291 transitions. [2021-06-05 21:48:43,212 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 2291 transitions. [2021-06-05 21:48:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:43,212 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:43,212 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:43,413 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 275 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3001 [2021-06-05 21:48:43,413 INFO L430 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:43,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:43,413 INFO L82 PathProgramCache]: Analyzing trace with hash -360500806, now seen corresponding path program 129 times [2021-06-05 21:48:43,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:43,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472752232] [2021-06-05 21:48:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:43,708 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:43,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472752232] [2021-06-05 21:48:43,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472752232] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:43,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064614909] [2021-06-05 21:48:43,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:43,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:48:43,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:43,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:43,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:43,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:43,810 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:43,811 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:43,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:43,814 INFO L388 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 11 [2021-06-05 21:48:43,815 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:43,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:43,817 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:43,818 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:43,820 INFO L388 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 12 [2021-06-05 21:48:43,821 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:43,853 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:43,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:43,854 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 21:48:43,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:43,977 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:43,978 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:43,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:43,981 INFO L388 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 35 treesize of output 27 [2021-06-05 21:48:43,981 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:43,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:43,984 INFO L388 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 11 [2021-06-05 21:48:43,985 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:43,987 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:43,988 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:44,027 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 21:48:44,029 INFO L388 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 [2021-06-05 21:48:44,030 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:44,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:44,046 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:44,046 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:48:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:44,114 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064614909] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:44,114 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:44,114 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:44,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824640275] [2021-06-05 21:48:44,114 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:44,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:44,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:44,115 INFO L87 Difference]: Start difference. First operand 641 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:44,465 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2021-06-05 21:48:44,882 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2021-06-05 21:48:45,074 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 21:48:45,229 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-05 21:48:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:45,302 INFO L93 Difference]: Finished difference Result 830 states and 2856 transitions. [2021-06-05 21:48:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:48:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:45,304 INFO L225 Difference]: With dead ends: 830 [2021-06-05 21:48:45,304 INFO L226 Difference]: Without dead ends: 825 [2021-06-05 21:48:45,304 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1216.3ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:48:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-06-05 21:48:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 643. [2021-06-05 21:48:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 3.5794392523364484) internal successors, (2298), 642 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2298 transitions. [2021-06-05 21:48:45,312 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 2298 transitions. Word has length 18 [2021-06-05 21:48:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:45,312 INFO L482 AbstractCegarLoop]: Abstraction has 643 states and 2298 transitions. [2021-06-05 21:48:45,312 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 2298 transitions. [2021-06-05 21:48:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:45,313 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:45,313 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:45,513 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3015,276 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:45,513 INFO L430 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:45,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:45,513 INFO L82 PathProgramCache]: Analyzing trace with hash 914447872, now seen corresponding path program 130 times [2021-06-05 21:48:45,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:45,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371377876] [2021-06-05 21:48:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:45,848 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:45,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371377876] [2021-06-05 21:48:45,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371377876] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:45,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555062683] [2021-06-05 21:48:45,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:45,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:48:45,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:45,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:48:45,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:45,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:45,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:45,946 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:45,947 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:45,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:45,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:45,950 INFO L388 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 11 [2021-06-05 21:48:45,951 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:45,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:45,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:45,954 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:45,955 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:45,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:45,957 INFO L388 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 12 [2021-06-05 21:48:45,958 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:45,999 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:46,001 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:46,001 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 21:48:46,277 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 21:48:46,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:46,281 INFO L388 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 11 [2021-06-05 21:48:46,282 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:46,285 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:46,285 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:46,286 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:46,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:46,290 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:46,291 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:46,294 INFO L388 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 35 treesize of output 27 [2021-06-05 21:48:46,295 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:46,374 INFO L628 ElimStorePlain]: treesize reduction 101, result has 40.9 percent of original size [2021-06-05 21:48:46,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:46,378 INFO L388 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 [2021-06-05 21:48:46,379 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:46,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:46,410 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:46,410 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:205, output treesize:50 [2021-06-05 21:48:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:46,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555062683] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:46,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:46,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 21:48:46,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573620288] [2021-06-05 21:48:46,510 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:48:46,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:46,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:48:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:48:46,511 INFO L87 Difference]: Start difference. First operand 643 states and 2298 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:46,744 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2021-06-05 21:48:46,902 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2021-06-05 21:48:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:47,164 INFO L93 Difference]: Finished difference Result 770 states and 2654 transitions. [2021-06-05 21:48:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:47,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:47,166 INFO L225 Difference]: With dead ends: 770 [2021-06-05 21:48:47,166 INFO L226 Difference]: Without dead ends: 757 [2021-06-05 21:48:47,166 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 966.4ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2021-06-05 21:48:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 642. [2021-06-05 21:48:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.578783151326053) internal successors, (2294), 641 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2294 transitions. [2021-06-05 21:48:47,173 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2294 transitions. Word has length 18 [2021-06-05 21:48:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:47,173 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2294 transitions. [2021-06-05 21:48:47,173 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2294 transitions. [2021-06-05 21:48:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:47,174 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:47,174 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:47,374 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3029,277 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:47,375 INFO L430 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash 903035708, now seen corresponding path program 131 times [2021-06-05 21:48:47,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:47,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605882262] [2021-06-05 21:48:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:48:47,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:47,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605882262] [2021-06-05 21:48:47,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605882262] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:47,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257878221] [2021-06-05 21:48:47,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:47,455 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:47,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:47,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 21:48:47,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:47,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:48:47,491 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:47,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:47,494 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:47,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:47,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:48:47,510 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:47,522 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:47,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:47,523 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 21:48:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:48:47,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257878221] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:47,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:47,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 21:48:47,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425966732] [2021-06-05 21:48:47,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 21:48:47,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 21:48:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:48:47,605 INFO L87 Difference]: Start difference. First operand 642 states and 2294 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:48,205 INFO L93 Difference]: Finished difference Result 1043 states and 3413 transitions. [2021-06-05 21:48:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:48:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:48,207 INFO L225 Difference]: With dead ends: 1043 [2021-06-05 21:48:48,207 INFO L226 Difference]: Without dead ends: 951 [2021-06-05 21:48:48,207 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 498.3ms TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:48:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-06-05 21:48:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 719. [2021-06-05 21:48:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 3.628133704735376) internal successors, (2605), 718 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 2605 transitions. [2021-06-05 21:48:48,220 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 2605 transitions. Word has length 18 [2021-06-05 21:48:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:48,220 INFO L482 AbstractCegarLoop]: Abstraction has 719 states and 2605 transitions. [2021-06-05 21:48:48,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 2605 transitions. [2021-06-05 21:48:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:48,221 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:48,221 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:48,422 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 278 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3043 [2021-06-05 21:48:48,422 INFO L430 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1742014878, now seen corresponding path program 132 times [2021-06-05 21:48:48,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:48,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345874758] [2021-06-05 21:48:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:48,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:48,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345874758] [2021-06-05 21:48:48,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345874758] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:48,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507364853] [2021-06-05 21:48:48,712 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:48,740 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:48:48,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:48,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:48,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:48,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:48,830 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:48,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:48,833 INFO L388 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 11 [2021-06-05 21:48:48,833 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:48,853 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:48,853 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:48,853 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 21:48:48,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:48:48,976 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:48,982 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:48,982 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:48:48,983 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:48,983 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:48:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:49,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507364853] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:49,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:49,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:48:49,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372662612] [2021-06-05 21:48:49,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:48:49,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:48:49,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:48:49,012 INFO L87 Difference]: Start difference. First operand 719 states and 2605 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:49,572 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2021-06-05 21:48:49,733 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-06-05 21:48:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:49,780 INFO L93 Difference]: Finished difference Result 816 states and 2879 transitions. [2021-06-05 21:48:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:48:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:49,782 INFO L225 Difference]: With dead ends: 816 [2021-06-05 21:48:49,782 INFO L226 Difference]: Without dead ends: 811 [2021-06-05 21:48:49,782 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 833.3ms TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:48:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-06-05 21:48:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 729. [2021-06-05 21:48:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 3.6263736263736264) internal successors, (2640), 728 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2640 transitions. [2021-06-05 21:48:49,790 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2640 transitions. Word has length 18 [2021-06-05 21:48:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:49,790 INFO L482 AbstractCegarLoop]: Abstraction has 729 states and 2640 transitions. [2021-06-05 21:48:49,790 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2640 transitions. [2021-06-05 21:48:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:49,791 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:49,791 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:49,991 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3051,279 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:49,991 INFO L430 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash -885518932, now seen corresponding path program 133 times [2021-06-05 21:48:49,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:49,992 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370695796] [2021-06-05 21:48:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:50,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:50,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370695796] [2021-06-05 21:48:50,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370695796] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:50,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600274973] [2021-06-05 21:48:50,279 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:50,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:48:50,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:50,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:50,398 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:50,398 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:50,401 INFO L388 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 11 [2021-06-05 21:48:50,402 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:50,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:50,421 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:50,421 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 21:48:50,555 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:50,555 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:50,556 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:50,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:50,559 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:50,560 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:50,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:50,563 INFO L388 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 11 [2021-06-05 21:48:50,564 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:50,566 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:50,567 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:50,608 INFO L628 ElimStorePlain]: treesize reduction 71, result has 39.3 percent of original size [2021-06-05 21:48:50,610 INFO L388 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 [2021-06-05 21:48:50,612 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:50,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:50,629 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:50,629 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 21:48:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:50,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600274973] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:50,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:50,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 21:48:50,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521510446] [2021-06-05 21:48:50,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:48:50,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:48:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:50,703 INFO L87 Difference]: Start difference. First operand 729 states and 2640 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:51,400 INFO L93 Difference]: Finished difference Result 842 states and 2944 transitions. [2021-06-05 21:48:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:48:51,401 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:51,402 INFO L225 Difference]: With dead ends: 842 [2021-06-05 21:48:51,402 INFO L226 Difference]: Without dead ends: 824 [2021-06-05 21:48:51,402 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 862.1ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:48:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-06-05 21:48:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 732. [2021-06-05 21:48:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.6238030095759233) internal successors, (2649), 731 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2649 transitions. [2021-06-05 21:48:51,410 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2649 transitions. Word has length 18 [2021-06-05 21:48:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:51,410 INFO L482 AbstractCegarLoop]: Abstraction has 732 states and 2649 transitions. [2021-06-05 21:48:51,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2649 transitions. [2021-06-05 21:48:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:51,411 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:51,411 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:51,611 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3058,280 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:51,612 INFO L430 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash 603886064, now seen corresponding path program 134 times [2021-06-05 21:48:51,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:51,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602188315] [2021-06-05 21:48:51,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:51,851 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:51,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602188315] [2021-06-05 21:48:51,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602188315] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:51,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23895626] [2021-06-05 21:48:51,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:51,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:51,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:51,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:51,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:52,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:52,001 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:52,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:52,006 INFO L388 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 11 [2021-06-05 21:48:52,007 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:52,039 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:52,040 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:52,041 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 21:48:52,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:48:52,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:52,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:48:52,159 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:52,175 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:48:52,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:48:52,179 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:52,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:52,187 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:52,187 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:48:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:52,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23895626] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:52,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:52,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:52,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945096363] [2021-06-05 21:48:52,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:52,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:52,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:52,221 INFO L87 Difference]: Start difference. First operand 732 states and 2649 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:52,682 INFO L93 Difference]: Finished difference Result 784 states and 2793 transitions. [2021-06-05 21:48:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:52,683 INFO L225 Difference]: With dead ends: 784 [2021-06-05 21:48:52,683 INFO L226 Difference]: Without dead ends: 779 [2021-06-05 21:48:52,683 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 543.8ms TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:48:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-06-05 21:48:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 738. [2021-06-05 21:48:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.622795115332429) internal successors, (2670), 737 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2670 transitions. [2021-06-05 21:48:52,691 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2670 transitions. Word has length 18 [2021-06-05 21:48:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:52,691 INFO L482 AbstractCegarLoop]: Abstraction has 738 states and 2670 transitions. [2021-06-05 21:48:52,691 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2670 transitions. [2021-06-05 21:48:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:52,692 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:52,692 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:52,892 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3068,281 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:52,892 INFO L430 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:52,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1336102682, now seen corresponding path program 135 times [2021-06-05 21:48:52,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:52,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788504523] [2021-06-05 21:48:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:53,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:53,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788504523] [2021-06-05 21:48:53,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788504523] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:53,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492515767] [2021-06-05 21:48:53,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:53,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:48:53,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:53,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:53,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:53,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:53,270 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:53,271 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:53,273 INFO L388 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 11 [2021-06-05 21:48:53,274 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:53,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:53,298 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:53,298 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 21:48:53,351 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_818], 1=[array_4, v_prenex_819]} [2021-06-05 21:48:53,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:53,354 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:53,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 21:48:53,358 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:53,400 INFO L628 ElimStorePlain]: treesize reduction 81, result has 38.2 percent of original size [2021-06-05 21:48:53,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:53,403 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:53,419 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:53,421 INFO L388 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 [2021-06-05 21:48:53,422 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:53,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:53,437 INFO L518 ElimStorePlain]: Eliminatee v_prenex_819 vanished before elimination [2021-06-05 21:48:53,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:53,438 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 21:48:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:53,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492515767] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:53,502 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:53,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:53,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58980071] [2021-06-05 21:48:53,502 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:53,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:53,503 INFO L87 Difference]: Start difference. First operand 738 states and 2670 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:53,934 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 21:48:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:54,183 INFO L93 Difference]: Finished difference Result 794 states and 2825 transitions. [2021-06-05 21:48:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:54,184 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:54,185 INFO L225 Difference]: With dead ends: 794 [2021-06-05 21:48:54,185 INFO L226 Difference]: Without dead ends: 789 [2021-06-05 21:48:54,185 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 749.8ms TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:48:54,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-06-05 21:48:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 735. [2021-06-05 21:48:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 3.6212534059945503) internal successors, (2658), 734 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 2658 transitions. [2021-06-05 21:48:54,198 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 2658 transitions. Word has length 18 [2021-06-05 21:48:54,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:54,198 INFO L482 AbstractCegarLoop]: Abstraction has 735 states and 2658 transitions. [2021-06-05 21:48:54,198 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 2658 transitions. [2021-06-05 21:48:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:54,199 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:54,199 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:54,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 282 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3078 [2021-06-05 21:48:54,399 INFO L430 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:54,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2085123934, now seen corresponding path program 136 times [2021-06-05 21:48:54,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:54,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683259903] [2021-06-05 21:48:54,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:54,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:54,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683259903] [2021-06-05 21:48:54,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683259903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:54,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900167980] [2021-06-05 21:48:54,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:54,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:48:54,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:54,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:54,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:54,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:48:54,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:54,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:48:54,857 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:54,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:54,878 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:54,878 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 21:48:54,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:54,945 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:54,946 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:54,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:54,950 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:54,951 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:54,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:54,954 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:54,955 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:54,958 INFO L388 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 11 [2021-06-05 21:48:54,959 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:55,012 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 21:48:55,014 INFO L388 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 [2021-06-05 21:48:55,016 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:55,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:55,034 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:55,034 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:48:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:55,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900167980] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:55,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:55,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:48:55,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585015072] [2021-06-05 21:48:55,110 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:48:55,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:48:55,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:48:55,110 INFO L87 Difference]: Start difference. First operand 735 states and 2658 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:55,931 INFO L93 Difference]: Finished difference Result 792 states and 2824 transitions. [2021-06-05 21:48:55,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:48:55,931 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:55,933 INFO L225 Difference]: With dead ends: 792 [2021-06-05 21:48:55,933 INFO L226 Difference]: Without dead ends: 787 [2021-06-05 21:48:55,933 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 910.3ms TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:48:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-06-05 21:48:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 732. [2021-06-05 21:48:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.6238030095759233) internal successors, (2649), 731 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2649 transitions. [2021-06-05 21:48:55,940 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2649 transitions. Word has length 18 [2021-06-05 21:48:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:55,940 INFO L482 AbstractCegarLoop]: Abstraction has 732 states and 2649 transitions. [2021-06-05 21:48:55,940 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2649 transitions. [2021-06-05 21:48:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:55,941 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:55,941 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:56,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 283 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3089 [2021-06-05 21:48:56,142 INFO L430 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1063225658, now seen corresponding path program 137 times [2021-06-05 21:48:56,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:56,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401120098] [2021-06-05 21:48:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:56,411 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:56,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401120098] [2021-06-05 21:48:56,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401120098] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:56,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877682814] [2021-06-05 21:48:56,411 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:56,439 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:48:56,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:56,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:56,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:56,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,492 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:56,493 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:56,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,496 INFO L388 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 11 [2021-06-05 21:48:56,497 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:56,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,500 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:56,501 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:56,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,504 INFO L388 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 12 [2021-06-05 21:48:56,504 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:56,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:56,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:56,555 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:159, output treesize:123 [2021-06-05 21:48:56,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,913 INFO L388 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 17 treesize of output 13 [2021-06-05 21:48:56,913 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:56,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,917 INFO L388 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 19 treesize of output 15 [2021-06-05 21:48:56,917 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:56,969 INFO L628 ElimStorePlain]: treesize reduction 73, result has 43.8 percent of original size [2021-06-05 21:48:56,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:56,972 INFO L388 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 [2021-06-05 21:48:56,973 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:56,991 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:56,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:48:56,994 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:57,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:57,010 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:48:57,012 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:57,012 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:144, output treesize:16 [2021-06-05 21:48:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:57,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877682814] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:57,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:57,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:48:57,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120148418] [2021-06-05 21:48:57,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:48:57,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:48:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:48:57,039 INFO L87 Difference]: Start difference. First operand 732 states and 2649 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:57,254 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-06-05 21:48:57,600 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 21:48:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:57,778 INFO L93 Difference]: Finished difference Result 902 states and 3109 transitions. [2021-06-05 21:48:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:57,778 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:57,780 INFO L225 Difference]: With dead ends: 902 [2021-06-05 21:48:57,780 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 21:48:57,780 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 919.8ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:48:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 21:48:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 742. [2021-06-05 21:48:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.6288798920377867) internal successors, (2689), 741 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2689 transitions. [2021-06-05 21:48:57,788 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2689 transitions. Word has length 18 [2021-06-05 21:48:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:57,788 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2689 transitions. [2021-06-05 21:48:57,788 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2689 transitions. [2021-06-05 21:48:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:57,789 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:57,789 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:57,990 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 284 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3099 [2021-06-05 21:48:57,990 INFO L430 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1919721604, now seen corresponding path program 138 times [2021-06-05 21:48:57,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:57,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797635533] [2021-06-05 21:48:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:58,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:58,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797635533] [2021-06-05 21:48:58,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797635533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:58,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960664079] [2021-06-05 21:48:58,244 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:58,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:48:58,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:48:58,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:58,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:58,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:58,326 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:58,327 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:58,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:58,330 INFO L388 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 12 [2021-06-05 21:48:58,331 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:58,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:58,334 INFO L388 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 11 [2021-06-05 21:48:58,334 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:58,337 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:58,337 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:58,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:58,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:58,380 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 21:48:58,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:58,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:58,634 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:58,634 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:58,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:58,637 INFO L388 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 27 treesize of output 21 [2021-06-05 21:48:58,638 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:58,668 INFO L628 ElimStorePlain]: treesize reduction 58, result has 34.1 percent of original size [2021-06-05 21:48:58,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_828 vanished before elimination [2021-06-05 21:48:58,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_829 vanished before elimination [2021-06-05 21:48:58,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:58,671 INFO L388 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 [2021-06-05 21:48:58,672 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:48:58,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:58,686 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:48:58,686 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 21:48:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:58,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960664079] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:58,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:48:58,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:48:58,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298419908] [2021-06-05 21:48:58,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:48:58,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:48:58,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:48:58,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:48:58,703 INFO L87 Difference]: Start difference. First operand 742 states and 2689 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:48:59,293 INFO L93 Difference]: Finished difference Result 896 states and 3107 transitions. [2021-06-05 21:48:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:48:59,293 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:48:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:48:59,294 INFO L225 Difference]: With dead ends: 896 [2021-06-05 21:48:59,294 INFO L226 Difference]: Without dead ends: 891 [2021-06-05 21:48:59,294 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 789.1ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:48:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-06-05 21:48:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 748. [2021-06-05 21:48:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6318607764390896) internal successors, (2713), 747 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2713 transitions. [2021-06-05 21:48:59,304 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2713 transitions. Word has length 18 [2021-06-05 21:48:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:48:59,304 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2713 transitions. [2021-06-05 21:48:59,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:48:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2713 transitions. [2021-06-05 21:48:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:48:59,305 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:48:59,305 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:48:59,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 285 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3120 [2021-06-05 21:48:59,506 INFO L430 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:48:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:48:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash -20267142, now seen corresponding path program 139 times [2021-06-05 21:48:59,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:48:59,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051165030] [2021-06-05 21:48:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:48:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:48:59,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:48:59,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051165030] [2021-06-05 21:48:59,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051165030] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:48:59,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182812375] [2021-06-05 21:48:59,760 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:48:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:48:59,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:48:59,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:48:59,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:59,837 INFO L388 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 11 [2021-06-05 21:48:59,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:59,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:59,841 INFO L388 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 26 treesize of output 20 [2021-06-05 21:48:59,842 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:59,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:48:59,844 INFO L388 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 25 treesize of output 19 [2021-06-05 21:48:59,845 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:59,848 INFO L388 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 12 [2021-06-05 21:48:59,848 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:48:59,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:48:59,898 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:48:59,898 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 21:49:00,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:00,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:00,065 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:00,066 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:00,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:00,069 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:00,070 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:00,120 INFO L628 ElimStorePlain]: treesize reduction 91, result has 38.1 percent of original size [2021-06-05 21:49:00,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:00,123 INFO L388 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 [2021-06-05 21:49:00,125 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:00,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:00,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:00,148 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:00,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:00,166 INFO L518 ElimStorePlain]: Eliminatee v_prenex_831 vanished before elimination [2021-06-05 21:49:00,167 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:00,167 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 21:49:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:00,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182812375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:00,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:00,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:49:00,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897011599] [2021-06-05 21:49:00,225 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:00,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:00,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:00,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:00,226 INFO L87 Difference]: Start difference. First operand 748 states and 2713 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:00,844 INFO L93 Difference]: Finished difference Result 919 states and 3174 transitions. [2021-06-05 21:49:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:00,845 INFO L225 Difference]: With dead ends: 919 [2021-06-05 21:49:00,845 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 21:49:00,846 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 763.1ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:49:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 21:49:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 738. [2021-06-05 21:49:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.628222523744912) internal successors, (2674), 737 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2674 transitions. [2021-06-05 21:49:00,860 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2674 transitions. Word has length 18 [2021-06-05 21:49:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:00,860 INFO L482 AbstractCegarLoop]: Abstraction has 738 states and 2674 transitions. [2021-06-05 21:49:00,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2674 transitions. [2021-06-05 21:49:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:00,861 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:00,861 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:01,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3137,286 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:01,061 INFO L430 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:01,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:01,062 INFO L82 PathProgramCache]: Analyzing trace with hash -446381756, now seen corresponding path program 140 times [2021-06-05 21:49:01,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:01,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148145394] [2021-06-05 21:49:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:01,326 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:01,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148145394] [2021-06-05 21:49:01,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148145394] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:01,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845453148] [2021-06-05 21:49:01,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:01,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:01,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:01,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:01,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:01,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:01,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:01,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 21:49:01,406 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:01,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:49:01,409 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:01,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:01,412 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:01,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:01,443 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:01,443 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 21:49:01,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:01,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:01,680 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:01,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:01,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:01,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:01,685 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:01,686 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:01,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:01,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:01,690 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:01,691 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:01,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:01,695 INFO L388 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 11 [2021-06-05 21:49:01,695 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:01,743 INFO L628 ElimStorePlain]: treesize reduction 86, result has 39.0 percent of original size [2021-06-05 21:49:01,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:01,746 INFO L388 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 [2021-06-05 21:49:01,747 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:01,768 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:01,769 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:01,769 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 21:49:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:01,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845453148] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:01,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:01,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:49:01,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787853267] [2021-06-05 21:49:01,820 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:01,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:01,820 INFO L87 Difference]: Start difference. First operand 738 states and 2674 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:02,197 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2021-06-05 21:49:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:02,844 INFO L93 Difference]: Finished difference Result 928 states and 3191 transitions. [2021-06-05 21:49:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:49:02,844 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:02,846 INFO L225 Difference]: With dead ends: 928 [2021-06-05 21:49:02,846 INFO L226 Difference]: Without dead ends: 923 [2021-06-05 21:49:02,846 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1006.8ms TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:49:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-06-05 21:49:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 740. [2021-06-05 21:49:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 3.6238159675236807) internal successors, (2678), 739 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2678 transitions. [2021-06-05 21:49:02,854 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2678 transitions. Word has length 18 [2021-06-05 21:49:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:02,855 INFO L482 AbstractCegarLoop]: Abstraction has 740 states and 2678 transitions. [2021-06-05 21:49:02,855 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2678 transitions. [2021-06-05 21:49:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:02,855 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:02,856 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:03,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 287 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3153 [2021-06-05 21:49:03,056 INFO L430 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:03,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2024323972, now seen corresponding path program 141 times [2021-06-05 21:49:03,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:03,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974228763] [2021-06-05 21:49:03,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:03,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:03,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974228763] [2021-06-05 21:49:03,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974228763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:03,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897054270] [2021-06-05 21:49:03,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:03,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:49:03,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:03,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 21:49:03,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:03,660 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:03,660 INFO L388 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 32 treesize of output 24 [2021-06-05 21:49:03,661 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,670 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 21:49:03,671 INFO L388 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 32 treesize of output 28 [2021-06-05 21:49:03,671 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,678 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:03,679 INFO L388 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 32 treesize of output 24 [2021-06-05 21:49:03,680 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,687 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:03,687 INFO L388 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 42 treesize of output 32 [2021-06-05 21:49:03,688 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,694 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:03,694 INFO L388 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 42 treesize of output 32 [2021-06-05 21:49:03,695 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,700 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:03,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 21:49:03,701 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,769 INFO L628 ElimStorePlain]: treesize reduction 93, result has 51.6 percent of original size [2021-06-05 21:49:03,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 21:49:03,770 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:298, output treesize:95 [2021-06-05 21:49:03,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:03,853 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:03,854 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:03,857 INFO L388 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 11 [2021-06-05 21:49:03,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:03,861 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:03,862 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:03,865 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:03,866 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:03,870 INFO L388 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 11 [2021-06-05 21:49:03,870 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,873 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:03,874 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:03,944 INFO L628 ElimStorePlain]: treesize reduction 132, result has 37.4 percent of original size [2021-06-05 21:49:03,947 INFO L388 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 [2021-06-05 21:49:03,948 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:03,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:03,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 21:49:03,978 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:255, output treesize:71 [2021-06-05 21:49:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:04,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897054270] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:04,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:04,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 21:49:04,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072083814] [2021-06-05 21:49:04,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:49:04,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:04,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:49:04,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:04,048 INFO L87 Difference]: Start difference. First operand 740 states and 2678 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:04,532 INFO L93 Difference]: Finished difference Result 813 states and 2847 transitions. [2021-06-05 21:49:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:04,533 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:04,534 INFO L225 Difference]: With dead ends: 813 [2021-06-05 21:49:04,534 INFO L226 Difference]: Without dead ends: 800 [2021-06-05 21:49:04,534 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 775.4ms TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:49:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-06-05 21:49:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 741. [2021-06-05 21:49:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 3.6202702702702703) internal successors, (2679), 740 states have internal predecessors, (2679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2679 transitions. [2021-06-05 21:49:04,543 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2679 transitions. Word has length 18 [2021-06-05 21:49:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:04,543 INFO L482 AbstractCegarLoop]: Abstraction has 741 states and 2679 transitions. [2021-06-05 21:49:04,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2679 transitions. [2021-06-05 21:49:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:04,544 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:04,544 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:04,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3167,288 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:04,744 INFO L430 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1165319792, now seen corresponding path program 142 times [2021-06-05 21:49:04,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:04,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565384625] [2021-06-05 21:49:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:05,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:05,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565384625] [2021-06-05 21:49:05,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565384625] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:05,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287503665] [2021-06-05 21:49:05,037 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:05,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:49:05,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:05,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:05,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:05,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:05,117 INFO L388 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 11 [2021-06-05 21:49:05,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:05,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:05,120 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:05,121 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:05,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:05,124 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:05,125 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:05,127 INFO L388 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 12 [2021-06-05 21:49:05,128 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:05,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:05,171 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:05,171 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 21:49:05,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:05,457 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:05,458 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:05,487 INFO L628 ElimStorePlain]: treesize reduction 58, result has 41.4 percent of original size [2021-06-05 21:49:05,487 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:49:05,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:05,489 INFO L388 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 27 treesize of output 21 [2021-06-05 21:49:05,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:05,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:05,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:05,501 INFO L388 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 [2021-06-05 21:49:05,502 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:05,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:05,511 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:05,511 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 21:49:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:05,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287503665] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:05,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:05,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:49:05,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228711381] [2021-06-05 21:49:05,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:05,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:05,528 INFO L87 Difference]: Start difference. First operand 741 states and 2679 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:05,888 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-06-05 21:49:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:06,114 INFO L93 Difference]: Finished difference Result 825 states and 2888 transitions. [2021-06-05 21:49:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:06,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:06,116 INFO L225 Difference]: With dead ends: 825 [2021-06-05 21:49:06,116 INFO L226 Difference]: Without dead ends: 820 [2021-06-05 21:49:06,116 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 836.9ms TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-06-05 21:49:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 748. [2021-06-05 21:49:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6238286479250337) internal successors, (2707), 747 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2707 transitions. [2021-06-05 21:49:06,124 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2707 transitions. Word has length 18 [2021-06-05 21:49:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:06,124 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2707 transitions. [2021-06-05 21:49:06,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2707 transitions. [2021-06-05 21:49:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:06,125 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:06,125 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:06,325 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3185,289 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:06,326 INFO L430 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash -774668954, now seen corresponding path program 143 times [2021-06-05 21:49:06,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:06,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464008621] [2021-06-05 21:49:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:06,602 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:06,602 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464008621] [2021-06-05 21:49:06,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464008621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:06,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490723204] [2021-06-05 21:49:06,603 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:06,630 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:06,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:06,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:06,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:06,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:06,699 INFO L388 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 11 [2021-06-05 21:49:06,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:06,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:06,703 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:06,703 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:06,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:06,706 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:06,707 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:06,709 INFO L388 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 12 [2021-06-05 21:49:06,710 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:06,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:06,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:06,747 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:93 [2021-06-05 21:49:06,921 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_843], 1=[v_prenex_844, array_4]} [2021-06-05 21:49:06,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:06,925 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:06,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:49:06,929 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:06,971 INFO L628 ElimStorePlain]: treesize reduction 71, result has 41.3 percent of original size [2021-06-05 21:49:06,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:06,974 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:06,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:06,990 INFO L518 ElimStorePlain]: Eliminatee v_prenex_844 vanished before elimination [2021-06-05 21:49:06,992 INFO L388 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 [2021-06-05 21:49:06,993 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:07,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:07,008 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:07,009 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 21:49:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:07,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490723204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:07,075 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:07,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:49:07,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125643713] [2021-06-05 21:49:07,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:49:07,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:49:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:07,075 INFO L87 Difference]: Start difference. First operand 748 states and 2707 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:07,362 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2021-06-05 21:49:07,559 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2021-06-05 21:49:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:07,791 INFO L93 Difference]: Finished difference Result 852 states and 2963 transitions. [2021-06-05 21:49:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:07,793 INFO L225 Difference]: With dead ends: 852 [2021-06-05 21:49:07,793 INFO L226 Difference]: Without dead ends: 847 [2021-06-05 21:49:07,793 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 872.6ms TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:49:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-06-05 21:49:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 742. [2021-06-05 21:49:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.620782726045884) internal successors, (2683), 741 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2683 transitions. [2021-06-05 21:49:07,801 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2683 transitions. Word has length 18 [2021-06-05 21:49:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:07,801 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2683 transitions. [2021-06-05 21:49:07,801 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2683 transitions. [2021-06-05 21:49:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:07,802 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:07,802 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:08,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 290 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3201 [2021-06-05 21:49:08,002 INFO L430 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash 423886118, now seen corresponding path program 144 times [2021-06-05 21:49:08,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:08,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177870613] [2021-06-05 21:49:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:08,322 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:08,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177870613] [2021-06-05 21:49:08,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177870613] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:08,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120873047] [2021-06-05 21:49:08,322 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:08,351 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:49:08,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:08,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 21:49:08,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:08,575 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 21:49:08,575 INFO L388 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 32 treesize of output 28 [2021-06-05 21:49:08,576 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,582 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:08,582 INFO L388 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 32 treesize of output 24 [2021-06-05 21:49:08,583 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,588 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:08,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 21:49:08,589 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,593 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:08,593 INFO L388 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 42 treesize of output 32 [2021-06-05 21:49:08,594 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,653 INFO L628 ElimStorePlain]: treesize reduction 29, result has 74.1 percent of original size [2021-06-05 21:49:08,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 21:49:08,654 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:180, output treesize:79 [2021-06-05 21:49:08,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:08,725 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:08,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:08,730 INFO L388 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 11 [2021-06-05 21:49:08,730 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:08,734 INFO L388 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 11 [2021-06-05 21:49:08,734 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:08,737 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:08,738 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:08,741 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:08,742 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,745 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:08,746 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,803 INFO L628 ElimStorePlain]: treesize reduction 102, result has 40.4 percent of original size [2021-06-05 21:49:08,805 INFO L388 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 22 treesize of output 14 [2021-06-05 21:49:08,806 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:08,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:08,829 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 21:49:08,829 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:223, output treesize:55 [2021-06-05 21:49:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:08,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120873047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:08,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:08,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:49:08,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057503884] [2021-06-05 21:49:08,913 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:49:08,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:49:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:08,913 INFO L87 Difference]: Start difference. First operand 742 states and 2683 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:09,478 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 21:49:09,713 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2021-06-05 21:49:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:10,160 INFO L93 Difference]: Finished difference Result 841 states and 2938 transitions. [2021-06-05 21:49:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:49:10,160 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:10,162 INFO L225 Difference]: With dead ends: 841 [2021-06-05 21:49:10,162 INFO L226 Difference]: Without dead ends: 836 [2021-06-05 21:49:10,162 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1311.7ms TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:49:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-06-05 21:49:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 742. [2021-06-05 21:49:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.620782726045884) internal successors, (2683), 741 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2683 transitions. [2021-06-05 21:49:10,170 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2683 transitions. Word has length 18 [2021-06-05 21:49:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:10,170 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2683 transitions. [2021-06-05 21:49:10,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2683 transitions. [2021-06-05 21:49:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:10,171 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:10,171 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:10,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3215,291 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:10,372 INFO L430 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:10,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1307733628, now seen corresponding path program 145 times [2021-06-05 21:49:10,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:10,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370026028] [2021-06-05 21:49:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:10,554 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:10,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370026028] [2021-06-05 21:49:10,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370026028] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:10,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675745553] [2021-06-05 21:49:10,554 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:10,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:49:10,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:10,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:10,686 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:10,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:10,689 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:10,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:10,721 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:10,721 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 21:49:10,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:10,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:10,864 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:10,865 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:10,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:10,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:10,868 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:10,869 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:10,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:10,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:10,873 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:10,874 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:10,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:10,877 INFO L388 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 11 [2021-06-05 21:49:10,878 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:10,937 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 21:49:10,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:10,940 INFO L388 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 22 treesize of output 14 [2021-06-05 21:49:10,941 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:10,961 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:10,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:10,963 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:44 [2021-06-05 21:49:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:11,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675745553] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:11,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:11,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 21:49:11,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55103422] [2021-06-05 21:49:11,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:49:11,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:49:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:49:11,031 INFO L87 Difference]: Start difference. First operand 742 states and 2683 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:11,363 INFO L93 Difference]: Finished difference Result 781 states and 2780 transitions. [2021-06-05 21:49:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:11,364 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:11,365 INFO L225 Difference]: With dead ends: 781 [2021-06-05 21:49:11,365 INFO L226 Difference]: Without dead ends: 768 [2021-06-05 21:49:11,365 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 472.6ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:49:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-06-05 21:49:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 748. [2021-06-05 21:49:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6157965194109773) internal successors, (2701), 747 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2701 transitions. [2021-06-05 21:49:11,373 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2701 transitions. Word has length 18 [2021-06-05 21:49:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:11,373 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2701 transitions. [2021-06-05 21:49:11,373 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2701 transitions. [2021-06-05 21:49:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:11,374 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:11,374 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:11,574 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3233,292 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:11,574 INFO L430 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1047244922, now seen corresponding path program 146 times [2021-06-05 21:49:11,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:11,575 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675745312] [2021-06-05 21:49:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:11,737 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:11,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675745312] [2021-06-05 21:49:11,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675745312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:11,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351420846] [2021-06-05 21:49:11,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:11,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:11,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:11,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:11,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:11,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:11,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:11,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:11,871 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:11,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:11,899 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:11,899 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 21:49:11,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:11,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:11,965 INFO L388 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 11 [2021-06-05 21:49:11,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:11,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:11,969 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:11,969 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:12,022 INFO L628 ElimStorePlain]: treesize reduction 89, result has 40.3 percent of original size [2021-06-05 21:49:12,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:12,024 INFO L388 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 27 treesize of output 21 [2021-06-05 21:49:12,025 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:12,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:12,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:12,048 INFO L388 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 [2021-06-05 21:49:12,049 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:12,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:12,068 INFO L518 ElimStorePlain]: Eliminatee v_prenex_850 vanished before elimination [2021-06-05 21:49:12,068 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:12,068 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 21:49:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:12,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351420846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:12,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:12,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:49:12,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930535335] [2021-06-05 21:49:12,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:12,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:12,126 INFO L87 Difference]: Start difference. First operand 748 states and 2701 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:12,460 INFO L93 Difference]: Finished difference Result 783 states and 2797 transitions. [2021-06-05 21:49:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:12,461 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:12,462 INFO L225 Difference]: With dead ends: 783 [2021-06-05 21:49:12,462 INFO L226 Difference]: Without dead ends: 778 [2021-06-05 21:49:12,462 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 359.1ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:49:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-06-05 21:49:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 745. [2021-06-05 21:49:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 3.618279569892473) internal successors, (2692), 744 states have internal predecessors, (2692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2692 transitions. [2021-06-05 21:49:12,470 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2692 transitions. Word has length 18 [2021-06-05 21:49:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:12,470 INFO L482 AbstractCegarLoop]: Abstraction has 745 states and 2692 transitions. [2021-06-05 21:49:12,470 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2692 transitions. [2021-06-05 21:49:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:12,471 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:12,471 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:12,671 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 293 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3243 [2021-06-05 21:49:12,671 INFO L430 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 173504242, now seen corresponding path program 147 times [2021-06-05 21:49:12,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:12,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492542352] [2021-06-05 21:49:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:12,873 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:12,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492542352] [2021-06-05 21:49:12,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492542352] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:12,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205215950] [2021-06-05 21:49:12,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:12,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:49:12,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:12,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:12,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:13,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:13,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:13,040 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:13,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:13,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:13,044 INFO L388 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 11 [2021-06-05 21:49:13,045 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:13,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:13,082 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:49:13,083 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 21:49:13,178 INFO L446 ElimStorePlain]: Different costs {1=[array_4, v_prenex_854], 3=[array_0, v_prenex_853]} [2021-06-05 21:49:13,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:13,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:13,183 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:13,184 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:13,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:13,188 INFO L388 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 11 [2021-06-05 21:49:13,189 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:13,256 INFO L628 ElimStorePlain]: treesize reduction 107, result has 43.4 percent of original size [2021-06-05 21:49:13,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:13,260 INFO L388 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 27 treesize of output 21 [2021-06-05 21:49:13,261 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:13,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:13,287 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:49:13,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:13,290 INFO L388 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 [2021-06-05 21:49:13,291 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:13,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:13,318 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:13,318 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:207, output treesize:35 [2021-06-05 21:49:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:13,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205215950] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:13,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:13,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2021-06-05 21:49:13,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882343438] [2021-06-05 21:49:13,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:49:13,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:49:13,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:49:13,375 INFO L87 Difference]: Start difference. First operand 745 states and 2692 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:13,997 INFO L93 Difference]: Finished difference Result 796 states and 2822 transitions. [2021-06-05 21:49:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:49:13,997 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:13,999 INFO L225 Difference]: With dead ends: 796 [2021-06-05 21:49:13,999 INFO L226 Difference]: Without dead ends: 791 [2021-06-05 21:49:14,000 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 625.9ms TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:49:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-06-05 21:49:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 748. [2021-06-05 21:49:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6198125836680055) internal successors, (2704), 747 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2704 transitions. [2021-06-05 21:49:14,016 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2704 transitions. Word has length 18 [2021-06-05 21:49:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:14,016 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2704 transitions. [2021-06-05 21:49:14,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2704 transitions. [2021-06-05 21:49:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:14,018 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:14,018 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:14,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 294 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3253 [2021-06-05 21:49:14,237 INFO L430 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1497471774, now seen corresponding path program 148 times [2021-06-05 21:49:14,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:14,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170908241] [2021-06-05 21:49:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:14,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:14,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170908241] [2021-06-05 21:49:14,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170908241] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:14,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127273708] [2021-06-05 21:49:14,456 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:14,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:49:14,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:14,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:49:14,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:14,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,620 INFO L388 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 11 [2021-06-05 21:49:14,620 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:14,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,623 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:14,624 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:14,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:14,667 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:49:14,667 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:99 [2021-06-05 21:49:14,810 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 21:49:14,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,815 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:14,816 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:14,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,820 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:14,820 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:14,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,824 INFO L388 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 11 [2021-06-05 21:49:14,825 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:14,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,828 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:14,829 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:14,899 INFO L628 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2021-06-05 21:49:14,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:14,902 INFO L388 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 22 treesize of output 14 [2021-06-05 21:49:14,902 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:14,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:14,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:14,928 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:207, output treesize:78 [2021-06-05 21:49:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:15,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127273708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:15,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:15,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 21:49:15,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518511798] [2021-06-05 21:49:15,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:49:15,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:49:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:49:15,039 INFO L87 Difference]: Start difference. First operand 748 states and 2704 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:15,395 INFO L93 Difference]: Finished difference Result 779 states and 2776 transitions. [2021-06-05 21:49:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:15,397 INFO L225 Difference]: With dead ends: 779 [2021-06-05 21:49:15,397 INFO L226 Difference]: Without dead ends: 768 [2021-06-05 21:49:15,397 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 510.9ms TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-06-05 21:49:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 748. [2021-06-05 21:49:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6157965194109773) internal successors, (2701), 747 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2701 transitions. [2021-06-05 21:49:15,405 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2701 transitions. Word has length 18 [2021-06-05 21:49:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:15,405 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2701 transitions. [2021-06-05 21:49:15,405 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2701 transitions. [2021-06-05 21:49:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:15,406 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:15,406 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:15,606 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3266,295 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:15,606 INFO L430 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash 722420652, now seen corresponding path program 149 times [2021-06-05 21:49:15,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:15,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026725418] [2021-06-05 21:49:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:15,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:15,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026725418] [2021-06-05 21:49:15,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026725418] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:15,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437683992] [2021-06-05 21:49:15,945 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:15,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:15,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:15,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:15,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:16,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:16,057 INFO L388 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 12 [2021-06-05 21:49:16,057 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:16,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:16,061 INFO L388 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 11 [2021-06-05 21:49:16,061 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:16,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:16,065 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:16,065 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:16,068 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:16,069 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:16,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:16,125 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:16,125 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:179, output treesize:143 [2021-06-05 21:49:16,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:16,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:16,379 INFO L388 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 19 treesize of output 15 [2021-06-05 21:49:16,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:16,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:16,383 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:16,383 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:16,419 INFO L628 ElimStorePlain]: treesize reduction 63, result has 41.7 percent of original size [2021-06-05 21:49:16,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:16,421 INFO L388 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 [2021-06-05 21:49:16,422 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:16,435 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:16,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:16,438 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:16,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:16,448 INFO L518 ElimStorePlain]: Eliminatee v_prenex_861 vanished before elimination [2021-06-05 21:49:16,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:16,449 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:122, output treesize:16 [2021-06-05 21:49:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:16,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437683992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:16,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:16,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 21:49:16,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113068925] [2021-06-05 21:49:16,479 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:49:16,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:16,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:49:16,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:49:16,479 INFO L87 Difference]: Start difference. First operand 748 states and 2701 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:16,788 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 21:49:17,093 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2021-06-05 21:49:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:17,200 INFO L93 Difference]: Finished difference Result 792 states and 2815 transitions. [2021-06-05 21:49:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:17,201 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:17,202 INFO L225 Difference]: With dead ends: 792 [2021-06-05 21:49:17,202 INFO L226 Difference]: Without dead ends: 787 [2021-06-05 21:49:17,202 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 981.5ms TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:49:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-06-05 21:49:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 754. [2021-06-05 21:49:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 3.6188579017264275) internal successors, (2725), 753 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 2725 transitions. [2021-06-05 21:49:17,210 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 2725 transitions. Word has length 18 [2021-06-05 21:49:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:17,210 INFO L482 AbstractCegarLoop]: Abstraction has 754 states and 2725 transitions. [2021-06-05 21:49:17,210 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 2725 transitions. [2021-06-05 21:49:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:17,211 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:17,211 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:17,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3289,296 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:17,411 INFO L430 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1217568094, now seen corresponding path program 150 times [2021-06-05 21:49:17,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:17,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883899394] [2021-06-05 21:49:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:17,677 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:17,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883899394] [2021-06-05 21:49:17,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883899394] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:17,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911705105] [2021-06-05 21:49:17,677 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:17,705 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:49:17,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:17,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:17,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:17,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:49:17,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:17,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:17,789 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:17,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 21:49:17,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:17,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:17,796 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:17,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:17,840 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:17,840 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:119 [2021-06-05 21:49:18,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:18,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:18,037 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:18,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:18,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:18,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:18,042 INFO L388 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 11 [2021-06-05 21:49:18,042 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:18,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:18,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:18,046 INFO L388 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 27 treesize of output 21 [2021-06-05 21:49:18,047 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:18,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:18,050 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:18,051 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:18,107 INFO L628 ElimStorePlain]: treesize reduction 82, result has 40.1 percent of original size [2021-06-05 21:49:18,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:18,110 INFO L388 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 [2021-06-05 21:49:18,111 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:18,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:18,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:18,132 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 21:49:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:18,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911705105] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:18,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:18,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:49:18,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747600859] [2021-06-05 21:49:18,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:18,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:18,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:18,186 INFO L87 Difference]: Start difference. First operand 754 states and 2725 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:18,457 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-06-05 21:49:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:18,830 INFO L93 Difference]: Finished difference Result 812 states and 2883 transitions. [2021-06-05 21:49:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:18,831 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:18,832 INFO L225 Difference]: With dead ends: 812 [2021-06-05 21:49:18,832 INFO L226 Difference]: Without dead ends: 807 [2021-06-05 21:49:18,832 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 772.6ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:49:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-06-05 21:49:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 747. [2021-06-05 21:49:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.6152815013404824) internal successors, (2697), 746 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2697 transitions. [2021-06-05 21:49:18,840 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 2697 transitions. Word has length 18 [2021-06-05 21:49:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:18,840 INFO L482 AbstractCegarLoop]: Abstraction has 747 states and 2697 transitions. [2021-06-05 21:49:18,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 2697 transitions. [2021-06-05 21:49:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:18,841 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:18,841 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:19,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 297 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3306 [2021-06-05 21:49:19,041 INFO L430 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:19,042 INFO L82 PathProgramCache]: Analyzing trace with hash 929513634, now seen corresponding path program 151 times [2021-06-05 21:49:19,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:19,042 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343992228] [2021-06-05 21:49:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:19,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:19,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343992228] [2021-06-05 21:49:19,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343992228] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:19,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629734139] [2021-06-05 21:49:19,366 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:19,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:19,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:19,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:19,489 INFO L388 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 12 [2021-06-05 21:49:19,490 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:19,501 INFO L388 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 11 [2021-06-05 21:49:19,501 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:19,504 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:19,505 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,508 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:19,509 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:19,547 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:19,547 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 21:49:19,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:19,664 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:19,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:19,668 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:19,669 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:19,672 INFO L388 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 11 [2021-06-05 21:49:19,672 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,675 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:19,675 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,716 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 21:49:19,718 INFO L388 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 22 treesize of output 14 [2021-06-05 21:49:19,719 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:19,734 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:19,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:19,735 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:49:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:19,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629734139] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:19,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:19,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:49:19,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126466503] [2021-06-05 21:49:19,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:49:19,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:19,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:49:19,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:19,804 INFO L87 Difference]: Start difference. First operand 747 states and 2697 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:20,238 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-06-05 21:49:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:20,718 INFO L93 Difference]: Finished difference Result 795 states and 2837 transitions. [2021-06-05 21:49:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:49:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:20,720 INFO L225 Difference]: With dead ends: 795 [2021-06-05 21:49:20,720 INFO L226 Difference]: Without dead ends: 790 [2021-06-05 21:49:20,720 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1051.5ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:49:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-06-05 21:49:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 748. [2021-06-05 21:49:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6131191432396252) internal successors, (2699), 747 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2699 transitions. [2021-06-05 21:49:20,727 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2699 transitions. Word has length 18 [2021-06-05 21:49:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:20,728 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2699 transitions. [2021-06-05 21:49:20,728 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2699 transitions. [2021-06-05 21:49:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:20,728 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:20,728 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:20,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3321,298 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:20,929 INFO L430 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1966146404, now seen corresponding path program 152 times [2021-06-05 21:49:20,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:20,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164455267] [2021-06-05 21:49:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:49:20,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:20,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164455267] [2021-06-05 21:49:20,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164455267] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:20,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766371583] [2021-06-05 21:49:20,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:21,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:21,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:21,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:21,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:21,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:21,070 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:21,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:21,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:21,073 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:21,074 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:21,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:21,077 INFO L388 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 12 [2021-06-05 21:49:21,078 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:21,080 INFO L388 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 11 [2021-06-05 21:49:21,081 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:21,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:21,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:21,107 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 21:49:21,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:21,211 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:21,212 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:21,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:21,214 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:21,215 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:21,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:21,218 INFO L388 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 11 [2021-06-05 21:49:21,218 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:21,220 INFO L388 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 12 [2021-06-05 21:49:21,221 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:21,252 INFO L628 ElimStorePlain]: treesize reduction 60, result has 31.0 percent of original size [2021-06-05 21:49:21,253 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:49:21,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:21,253 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:27 [2021-06-05 21:49:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:21,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766371583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:21,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:21,283 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:49:21,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849960042] [2021-06-05 21:49:21,283 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:21,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:21,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:21,284 INFO L87 Difference]: Start difference. First operand 748 states and 2699 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:22,261 INFO L93 Difference]: Finished difference Result 1086 states and 3629 transitions. [2021-06-05 21:49:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 21:49:22,261 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:22,262 INFO L225 Difference]: With dead ends: 1086 [2021-06-05 21:49:22,262 INFO L226 Difference]: Without dead ends: 963 [2021-06-05 21:49:22,262 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 876.4ms TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2021-06-05 21:49:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-06-05 21:49:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 781. [2021-06-05 21:49:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 3.693589743589744) internal successors, (2881), 780 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 2881 transitions. [2021-06-05 21:49:22,272 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 2881 transitions. Word has length 18 [2021-06-05 21:49:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:22,272 INFO L482 AbstractCegarLoop]: Abstraction has 781 states and 2881 transitions. [2021-06-05 21:49:22,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 2881 transitions. [2021-06-05 21:49:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:22,273 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:22,273 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:22,473 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3336,299 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:22,473 INFO L430 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1651169188, now seen corresponding path program 153 times [2021-06-05 21:49:22,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:22,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139079383] [2021-06-05 21:49:22,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:49:22,520 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:22,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139079383] [2021-06-05 21:49:22,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139079383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:22,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989728701] [2021-06-05 21:49:22,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:22,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:49:22,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:22,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:22,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:22,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:22,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:22,642 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:49:22,645 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:22,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:49:22,661 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,674 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:22,674 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:22,674 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2021-06-05 21:49:22,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:22,712 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:22,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,715 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:22,716 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:22,719 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:22,722 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:22,725 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,738 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:22,739 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,742 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:22,742 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,745 INFO L388 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 12 [2021-06-05 21:49:22,746 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:22,782 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 21:49:22,782 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:49:22,783 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:22,783 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 21:49:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:22,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989728701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:22,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:22,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:49:22,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143552772] [2021-06-05 21:49:22,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:22,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:22,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:22,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:22,826 INFO L87 Difference]: Start difference. First operand 781 states and 2881 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:23,485 INFO L93 Difference]: Finished difference Result 1046 states and 3567 transitions. [2021-06-05 21:49:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 21:49:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:23,487 INFO L225 Difference]: With dead ends: 1046 [2021-06-05 21:49:23,487 INFO L226 Difference]: Without dead ends: 980 [2021-06-05 21:49:23,487 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 486.3ms TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:49:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2021-06-05 21:49:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 829. [2021-06-05 21:49:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 3.6642512077294684) internal successors, (3034), 828 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 3034 transitions. [2021-06-05 21:49:23,497 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 3034 transitions. Word has length 18 [2021-06-05 21:49:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:23,497 INFO L482 AbstractCegarLoop]: Abstraction has 829 states and 3034 transitions. [2021-06-05 21:49:23,497 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 3034 transitions. [2021-06-05 21:49:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:23,498 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:23,498 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:23,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 300 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3347 [2021-06-05 21:49:23,698 INFO L430 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:23,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:23,698 INFO L82 PathProgramCache]: Analyzing trace with hash 555703338, now seen corresponding path program 154 times [2021-06-05 21:49:23,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:23,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587697509] [2021-06-05 21:49:23,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:24,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:24,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587697509] [2021-06-05 21:49:24,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587697509] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:24,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864516710] [2021-06-05 21:49:24,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:24,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:49:24,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:24,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:49:24,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:24,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,415 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:24,416 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,419 INFO L388 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 11 [2021-06-05 21:49:24,420 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,425 INFO L388 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 12 [2021-06-05 21:49:24,425 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,429 INFO L388 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 11 [2021-06-05 21:49:24,429 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,433 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:24,434 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,438 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:24,438 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,442 INFO L388 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 12 [2021-06-05 21:49:24,443 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,447 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:24,447 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,451 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:24,452 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,455 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:24,456 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,578 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2021-06-05 21:49:24,579 INFO L628 ElimStorePlain]: treesize reduction 124, result has 58.5 percent of original size [2021-06-05 21:49:24,580 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:49:24,580 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:385, output treesize:175 [2021-06-05 21:49:24,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,743 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:24,744 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,748 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:24,749 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:24,752 INFO L388 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 11 [2021-06-05 21:49:24,753 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,756 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:24,757 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,807 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.9 percent of original size [2021-06-05 21:49:24,810 INFO L388 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 22 treesize of output 14 [2021-06-05 21:49:24,811 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:24,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:24,832 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:24,833 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 21:49:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:24,935 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864516710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:24,935 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:24,935 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 21:49:24,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776809997] [2021-06-05 21:49:24,936 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:49:24,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:24,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:49:24,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:49:24,936 INFO L87 Difference]: Start difference. First operand 829 states and 3034 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:25,473 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 57 [2021-06-05 21:49:25,673 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-06-05 21:49:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:25,803 INFO L93 Difference]: Finished difference Result 858 states and 3091 transitions. [2021-06-05 21:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:25,804 INFO L225 Difference]: With dead ends: 858 [2021-06-05 21:49:25,804 INFO L226 Difference]: Without dead ends: 844 [2021-06-05 21:49:25,804 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1421.5ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:49:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-06-05 21:49:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 826. [2021-06-05 21:49:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 3.667878787878788) internal successors, (3026), 825 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 3026 transitions. [2021-06-05 21:49:25,813 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 3026 transitions. Word has length 18 [2021-06-05 21:49:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:25,813 INFO L482 AbstractCegarLoop]: Abstraction has 826 states and 3026 transitions. [2021-06-05 21:49:25,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 3026 transitions. [2021-06-05 21:49:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:25,814 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:25,815 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:26,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3357,301 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:26,015 INFO L430 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash -623377692, now seen corresponding path program 155 times [2021-06-05 21:49:26,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:26,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182189863] [2021-06-05 21:49:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:49:26,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:26,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182189863] [2021-06-05 21:49:26,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182189863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:26,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748130524] [2021-06-05 21:49:26,067 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:26,096 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:49:26,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:26,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 21:49:26,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:26,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:26,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:26,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:49:26,151 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:26,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:26,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:49:26,167 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:26,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:26,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:26,180 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 21:49:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:49:26,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748130524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:26,243 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:26,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 21:49:26,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553523236] [2021-06-05 21:49:26,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 21:49:26,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:26,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 21:49:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-05 21:49:26,244 INFO L87 Difference]: Start difference. First operand 826 states and 3026 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:26,651 INFO L93 Difference]: Finished difference Result 1161 states and 3992 transitions. [2021-06-05 21:49:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 21:49:26,651 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:26,653 INFO L225 Difference]: With dead ends: 1161 [2021-06-05 21:49:26,653 INFO L226 Difference]: Without dead ends: 1098 [2021-06-05 21:49:26,653 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 366.7ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:49:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-06-05 21:49:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 856. [2021-06-05 21:49:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 3.709941520467836) internal successors, (3172), 855 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 3172 transitions. [2021-06-05 21:49:26,664 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 3172 transitions. Word has length 18 [2021-06-05 21:49:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:26,664 INFO L482 AbstractCegarLoop]: Abstraction has 856 states and 3172 transitions. [2021-06-05 21:49:26,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 3172 transitions. [2021-06-05 21:49:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:26,665 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:26,665 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:26,865 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 302 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3371 [2021-06-05 21:49:26,866 INFO L430 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash -869997864, now seen corresponding path program 156 times [2021-06-05 21:49:26,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:26,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061295290] [2021-06-05 21:49:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:49:26,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:26,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061295290] [2021-06-05 21:49:26,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061295290] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:26,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494632055] [2021-06-05 21:49:26,920 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:26,948 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:49:26,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:26,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:49:26,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:27,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:27,037 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:27,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:27,040 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:27,041 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:27,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:27,043 INFO L388 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 12 [2021-06-05 21:49:27,044 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:27,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:27,047 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:27,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:27,050 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:27,052 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:27,053 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:27,088 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 21:49:27,089 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:27,089 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 21:49:27,128 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_866, array_0, array_2], 1=[v_prenex_867]} [2021-06-05 21:49:27,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:49:27,131 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:27,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:49:27,134 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:27,161 INFO L628 ElimStorePlain]: treesize reduction 33, result has 52.2 percent of original size [2021-06-05 21:49:27,161 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:49:27,161 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:49:27,163 INFO L388 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 10 treesize of output 6 [2021-06-05 21:49:27,165 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:27,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:27,177 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:27,177 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:83, output treesize:30 [2021-06-05 21:49:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:27,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494632055] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:27,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:27,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:49:27,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681556666] [2021-06-05 21:49:27,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:27,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:27,213 INFO L87 Difference]: Start difference. First operand 856 states and 3172 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:28,095 INFO L93 Difference]: Finished difference Result 1058 states and 3660 transitions. [2021-06-05 21:49:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 21:49:28,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:28,097 INFO L225 Difference]: With dead ends: 1058 [2021-06-05 21:49:28,097 INFO L226 Difference]: Without dead ends: 996 [2021-06-05 21:49:28,097 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 634.3ms TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2021-06-05 21:49:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-06-05 21:49:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 834. [2021-06-05 21:49:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 3.6614645858343335) internal successors, (3050), 833 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 3050 transitions. [2021-06-05 21:49:28,107 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 3050 transitions. Word has length 18 [2021-06-05 21:49:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:28,107 INFO L482 AbstractCegarLoop]: Abstraction has 834 states and 3050 transitions. [2021-06-05 21:49:28,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 3050 transitions. [2021-06-05 21:49:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:28,109 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:28,109 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:28,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3378,303 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:28,309 INFO L430 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:28,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:28,309 INFO L82 PathProgramCache]: Analyzing trace with hash -696750172, now seen corresponding path program 157 times [2021-06-05 21:49:28,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:28,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869017309] [2021-06-05 21:49:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:49:28,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:28,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869017309] [2021-06-05 21:49:28,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869017309] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:28,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639343443] [2021-06-05 21:49:28,362 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:28,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:49:28,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:28,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:28,495 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:28,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:28,500 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:28,500 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:28,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:28,504 INFO L388 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 12 [2021-06-05 21:49:28,505 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:28,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:28,509 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:28,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:28,513 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:28,516 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:28,516 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:28,551 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 21:49:28,552 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:28,552 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 21:49:28,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:49:28,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:28,615 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 21:49:28,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:49:28,617 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:28,618 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:28,619 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:28,619 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 21:49:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:28,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639343443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:28,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:28,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:49:28,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927949409] [2021-06-05 21:49:28,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:28,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:28,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:28,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:28,627 INFO L87 Difference]: Start difference. First operand 834 states and 3050 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:29,738 INFO L93 Difference]: Finished difference Result 1132 states and 3930 transitions. [2021-06-05 21:49:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 21:49:29,738 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:29,740 INFO L225 Difference]: With dead ends: 1132 [2021-06-05 21:49:29,740 INFO L226 Difference]: Without dead ends: 1078 [2021-06-05 21:49:29,740 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 807.2ms TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 21:49:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-06-05 21:49:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 837. [2021-06-05 21:49:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 3.648325358851675) internal successors, (3050), 836 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 3050 transitions. [2021-06-05 21:49:29,750 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 3050 transitions. Word has length 18 [2021-06-05 21:49:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:29,750 INFO L482 AbstractCegarLoop]: Abstraction has 837 states and 3050 transitions. [2021-06-05 21:49:29,750 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 3050 transitions. [2021-06-05 21:49:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:29,751 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:29,751 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:29,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3388,304 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:29,953 INFO L430 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:29,953 INFO L82 PathProgramCache]: Analyzing trace with hash -565449940, now seen corresponding path program 158 times [2021-06-05 21:49:29,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:29,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367051856] [2021-06-05 21:49:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:30,375 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 21:49:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:30,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:30,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367051856] [2021-06-05 21:49:30,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367051856] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:30,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395605698] [2021-06-05 21:49:30,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:30,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:30,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:30,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:30,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:30,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:30,818 INFO L388 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 12 [2021-06-05 21:49:30,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:30,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:30,822 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:30,823 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:30,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:30,827 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:30,827 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:30,830 INFO L388 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 11 [2021-06-05 21:49:30,831 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:30,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:30,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:30,881 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 21:49:31,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:49:31,076 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:31,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:49:31,079 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:31,097 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:49:31,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:49:31,101 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:31,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:31,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:31,109 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:49:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:31,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395605698] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:31,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:31,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:49:31,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921600690] [2021-06-05 21:49:31,151 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:49:31,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:49:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:49:31,151 INFO L87 Difference]: Start difference. First operand 837 states and 3050 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:31,956 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 21:49:32,346 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2021-06-05 21:49:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:32,496 INFO L93 Difference]: Finished difference Result 932 states and 3319 transitions. [2021-06-05 21:49:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:49:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:32,499 INFO L225 Difference]: With dead ends: 932 [2021-06-05 21:49:32,499 INFO L226 Difference]: Without dead ends: 922 [2021-06-05 21:49:32,499 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1718.8ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:49:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-06-05 21:49:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 841. [2021-06-05 21:49:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.645238095238095) internal successors, (3062), 840 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 3062 transitions. [2021-06-05 21:49:32,511 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 3062 transitions. Word has length 18 [2021-06-05 21:49:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:32,511 INFO L482 AbstractCegarLoop]: Abstraction has 841 states and 3062 transitions. [2021-06-05 21:49:32,511 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 3062 transitions. [2021-06-05 21:49:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:32,512 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:32,512 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:32,712 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3398,305 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:32,713 INFO L430 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash 733291496, now seen corresponding path program 159 times [2021-06-05 21:49:32,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:32,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435900742] [2021-06-05 21:49:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:32,762 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:32,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435900742] [2021-06-05 21:49:32,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435900742] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:32,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350511762] [2021-06-05 21:49:32,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:32,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:49:32,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:32,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:49:32,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:32,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:32,873 INFO L388 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 11 [2021-06-05 21:49:32,873 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:32,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:32,876 INFO L388 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 12 [2021-06-05 21:49:32,877 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:32,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:32,880 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:32,880 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:32,883 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:32,884 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:32,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:32,914 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:32,914 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 21:49:33,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:33,008 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:33,009 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:33,011 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:33,012 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:33,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:33,015 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:33,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:33,018 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:33,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:33,021 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:33,023 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:33,023 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:33,025 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:49:33,026 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:33,027 INFO L388 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 12 [2021-06-05 21:49:33,028 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:33,055 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 21:49:33,056 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:49:33,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:33,056 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 21:49:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:33,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350511762] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:33,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:33,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:49:33,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775251565] [2021-06-05 21:49:33,094 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:33,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:33,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:33,094 INFO L87 Difference]: Start difference. First operand 841 states and 3062 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:33,772 INFO L93 Difference]: Finished difference Result 1193 states and 4069 transitions. [2021-06-05 21:49:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 21:49:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:33,774 INFO L225 Difference]: With dead ends: 1193 [2021-06-05 21:49:33,774 INFO L226 Difference]: Without dead ends: 1117 [2021-06-05 21:49:33,774 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 559.5ms TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:49:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-06-05 21:49:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 866. [2021-06-05 21:49:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 3.7179190751445086) internal successors, (3216), 865 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 3216 transitions. [2021-06-05 21:49:33,786 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 3216 transitions. Word has length 18 [2021-06-05 21:49:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:33,786 INFO L482 AbstractCegarLoop]: Abstraction has 866 states and 3216 transitions. [2021-06-05 21:49:33,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 3216 transitions. [2021-06-05 21:49:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:33,787 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:33,788 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:33,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3412,306 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:33,988 INFO L430 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290764, now seen corresponding path program 160 times [2021-06-05 21:49:33,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:33,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40029042] [2021-06-05 21:49:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:34,189 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:34,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40029042] [2021-06-05 21:49:34,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40029042] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:34,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204357849] [2021-06-05 21:49:34,190 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:34,218 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:49:34,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:34,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:49:34,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:34,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:34,347 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:34,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:34,351 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:34,388 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:34,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:34,389 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 21:49:34,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:34,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:34,538 INFO L388 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 11 [2021-06-05 21:49:34,539 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:34,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:34,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:34,543 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:34,544 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:34,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:34,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:34,548 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:34,548 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:34,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:34,552 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:34,553 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:34,604 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 21:49:34,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:34,607 INFO L388 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 22 treesize of output 14 [2021-06-05 21:49:34,608 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:34,629 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:34,630 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:34,631 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:181, output treesize:44 [2021-06-05 21:49:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:34,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204357849] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:34,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:34,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 21:49:34,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100121545] [2021-06-05 21:49:34,699 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:49:34,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:34,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:49:34,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:49:34,699 INFO L87 Difference]: Start difference. First operand 866 states and 3216 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:34,984 INFO L93 Difference]: Finished difference Result 900 states and 3303 transitions. [2021-06-05 21:49:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:34,985 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:34,986 INFO L225 Difference]: With dead ends: 900 [2021-06-05 21:49:34,986 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 21:49:34,986 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 498.3ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:49:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 21:49:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 873. [2021-06-05 21:49:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 3.7121559633027523) internal successors, (3237), 872 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 3237 transitions. [2021-06-05 21:49:34,995 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 3237 transitions. Word has length 18 [2021-06-05 21:49:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:34,995 INFO L482 AbstractCegarLoop]: Abstraction has 873 states and 3237 transitions. [2021-06-05 21:49:34,995 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 3237 transitions. [2021-06-05 21:49:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:34,996 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:34,996 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:35,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 307 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3424 [2021-06-05 21:49:35,200 INFO L430 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:35,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash -642697982, now seen corresponding path program 161 times [2021-06-05 21:49:35,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:35,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008219546] [2021-06-05 21:49:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:35,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:35,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008219546] [2021-06-05 21:49:35,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008219546] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:35,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335843916] [2021-06-05 21:49:35,394 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:35,422 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:35,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:35,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:35,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:35,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:35,519 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:35,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:35,522 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:35,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:35,549 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:35,549 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 21:49:35,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:35,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:35,616 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:35,617 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:35,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:35,620 INFO L388 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 27 treesize of output 21 [2021-06-05 21:49:35,621 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:35,672 INFO L628 ElimStorePlain]: treesize reduction 87, result has 39.2 percent of original size [2021-06-05 21:49:35,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:35,675 INFO L388 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 [2021-06-05 21:49:35,676 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:35,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:35,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:49:35,699 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:35,718 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:35,718 INFO L518 ElimStorePlain]: Eliminatee v_prenex_872 vanished before elimination [2021-06-05 21:49:35,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:35,719 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 21:49:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:35,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335843916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:35,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:35,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:49:35,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183031343] [2021-06-05 21:49:35,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:49:35,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:35,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:49:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:49:35,775 INFO L87 Difference]: Start difference. First operand 873 states and 3237 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:36,084 INFO L93 Difference]: Finished difference Result 902 states and 3320 transitions. [2021-06-05 21:49:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:36,086 INFO L225 Difference]: With dead ends: 902 [2021-06-05 21:49:36,086 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 21:49:36,086 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 378.3ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:49:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 21:49:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 870. [2021-06-05 21:49:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 3.714614499424626) internal successors, (3228), 869 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 3228 transitions. [2021-06-05 21:49:36,095 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 3228 transitions. Word has length 18 [2021-06-05 21:49:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:36,095 INFO L482 AbstractCegarLoop]: Abstraction has 870 states and 3228 transitions. [2021-06-05 21:49:36,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 3228 transitions. [2021-06-05 21:49:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:36,096 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:36,096 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:36,297 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3433,308 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:36,297 INFO L430 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1516438662, now seen corresponding path program 162 times [2021-06-05 21:49:36,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:36,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952844847] [2021-06-05 21:49:36,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:36,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:36,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952844847] [2021-06-05 21:49:36,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952844847] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:36,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074025081] [2021-06-05 21:49:36,530 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:36,559 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:49:36,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:36,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:36,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:36,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:36,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:36,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:36,668 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:36,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:36,684 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:36,684 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 21:49:36,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:36,743 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:36,743 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:36,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:36,746 INFO L388 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 27 treesize of output 21 [2021-06-05 21:49:36,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:36,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:36,750 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:36,751 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:36,753 INFO L388 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 11 [2021-06-05 21:49:36,754 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:36,794 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 21:49:36,796 INFO L388 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 22 treesize of output 14 [2021-06-05 21:49:36,797 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:36,811 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:36,812 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:36,812 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:49:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:36,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074025081] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:36,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:36,878 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:49:36,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158566026] [2021-06-05 21:49:36,878 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:49:36,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:49:36,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:36,878 INFO L87 Difference]: Start difference. First operand 870 states and 3228 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:37,482 INFO L93 Difference]: Finished difference Result 905 states and 3329 transitions. [2021-06-05 21:49:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:37,484 INFO L225 Difference]: With dead ends: 905 [2021-06-05 21:49:37,484 INFO L226 Difference]: Without dead ends: 900 [2021-06-05 21:49:37,484 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 680.3ms TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:49:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-06-05 21:49:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 870. [2021-06-05 21:49:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 3.714614499424626) internal successors, (3228), 869 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 3228 transitions. [2021-06-05 21:49:37,494 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 3228 transitions. Word has length 18 [2021-06-05 21:49:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:37,494 INFO L482 AbstractCegarLoop]: Abstraction has 870 states and 3228 transitions. [2021-06-05 21:49:37,494 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 3228 transitions. [2021-06-05 21:49:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:37,495 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:37,495 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:37,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3443,309 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:37,695 INFO L430 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash -967522252, now seen corresponding path program 163 times [2021-06-05 21:49:37,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:37,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176811953] [2021-06-05 21:49:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:38,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:38,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176811953] [2021-06-05 21:49:38,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176811953] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:38,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882635768] [2021-06-05 21:49:38,030 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:38,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:49:38,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:38,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:38,151 INFO L388 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 12 [2021-06-05 21:49:38,151 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:38,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:38,155 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:38,156 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:38,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:38,159 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:38,160 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:38,163 INFO L388 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 11 [2021-06-05 21:49:38,163 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:38,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:38,215 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:38,215 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 21:49:38,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:38,397 INFO L388 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 27 treesize of output 21 [2021-06-05 21:49:38,398 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:38,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:38,401 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:38,402 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:38,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:38,404 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:38,405 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:38,407 INFO L388 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 11 [2021-06-05 21:49:38,408 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:38,450 INFO L628 ElimStorePlain]: treesize reduction 77, result has 37.4 percent of original size [2021-06-05 21:49:38,453 INFO L388 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 [2021-06-05 21:49:38,454 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:38,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:38,470 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:38,471 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 21:49:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:38,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882635768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:38,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:38,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 21:49:38,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389685958] [2021-06-05 21:49:38,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:49:38,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:49:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:49:38,539 INFO L87 Difference]: Start difference. First operand 870 states and 3228 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:38,969 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 21:49:39,264 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2021-06-05 21:49:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:39,383 INFO L93 Difference]: Finished difference Result 909 states and 3329 transitions. [2021-06-05 21:49:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:39,385 INFO L225 Difference]: With dead ends: 909 [2021-06-05 21:49:39,385 INFO L226 Difference]: Without dead ends: 896 [2021-06-05 21:49:39,385 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1096.8ms TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:49:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2021-06-05 21:49:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 877. [2021-06-05 21:49:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7100456621004567) internal successors, (3250), 876 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3250 transitions. [2021-06-05 21:49:39,394 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3250 transitions. Word has length 18 [2021-06-05 21:49:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:39,394 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3250 transitions. [2021-06-05 21:49:39,394 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3250 transitions. [2021-06-05 21:49:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:39,396 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:39,396 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:39,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3454,310 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:39,596 INFO L430 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1387456298, now seen corresponding path program 164 times [2021-06-05 21:49:39,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:39,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964558836] [2021-06-05 21:49:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:39,917 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:39,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964558836] [2021-06-05 21:49:39,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964558836] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:39,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227203763] [2021-06-05 21:49:39,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:39,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:39,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:39,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:39,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:40,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:40,034 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:40,035 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:40,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:40,038 INFO L388 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 11 [2021-06-05 21:49:40,039 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:40,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:40,042 INFO L388 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 12 [2021-06-05 21:49:40,043 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:40,046 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:40,046 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:40,099 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:40,100 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:40,100 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 21:49:40,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:40,214 INFO L388 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 27 treesize of output 21 [2021-06-05 21:49:40,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:40,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:40,218 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:40,218 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:40,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:40,221 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:40,222 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:40,224 INFO L388 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 11 [2021-06-05 21:49:40,225 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:40,263 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 21:49:40,265 INFO L388 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 [2021-06-05 21:49:40,266 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:40,281 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:40,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:40,282 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:49:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:40,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227203763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:40,350 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:40,350 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:49:40,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563112811] [2021-06-05 21:49:40,350 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:49:40,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:40,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:49:40,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:40,350 INFO L87 Difference]: Start difference. First operand 877 states and 3250 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:40,735 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-06-05 21:49:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:40,994 INFO L93 Difference]: Finished difference Result 917 states and 3367 transitions. [2021-06-05 21:49:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:40,996 INFO L225 Difference]: With dead ends: 917 [2021-06-05 21:49:40,996 INFO L226 Difference]: Without dead ends: 912 [2021-06-05 21:49:40,996 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 834.9ms TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:49:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2021-06-05 21:49:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 874. [2021-06-05 21:49:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 3.7124856815578466) internal successors, (3241), 873 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 3241 transitions. [2021-06-05 21:49:41,005 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 3241 transitions. Word has length 18 [2021-06-05 21:49:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:41,005 INFO L482 AbstractCegarLoop]: Abstraction has 874 states and 3241 transitions. [2021-06-05 21:49:41,005 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 3241 transitions. [2021-06-05 21:49:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:41,006 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:41,006 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:41,207 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3467,311 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:41,207 INFO L430 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:41,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:41,207 INFO L82 PathProgramCache]: Analyzing trace with hash -760429270, now seen corresponding path program 165 times [2021-06-05 21:49:41,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:41,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717808591] [2021-06-05 21:49:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:41,487 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:41,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717808591] [2021-06-05 21:49:41,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717808591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:41,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389662566] [2021-06-05 21:49:41,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:41,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:49:41,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:41,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:41,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:41,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:41,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:41,588 INFO L388 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 12 [2021-06-05 21:49:41,589 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:41,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:41,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:41,593 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:41,593 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:41,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:41,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:41,597 INFO L388 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 11 [2021-06-05 21:49:41,598 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:41,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:41,601 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:41,602 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:41,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:41,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:41,648 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:179, output treesize:143 [2021-06-05 21:49:41,768 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 21:49:41,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:41,772 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:41,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:49:41,775 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:41,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:41,779 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:41,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:49:41,782 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:41,828 INFO L628 ElimStorePlain]: treesize reduction 70, result has 41.2 percent of original size [2021-06-05 21:49:41,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:41,830 INFO L388 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 [2021-06-05 21:49:41,831 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:41,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:41,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:41,850 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:155, output treesize:41 [2021-06-05 21:49:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:41,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389662566] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:41,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:41,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:49:41,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045063853] [2021-06-05 21:49:41,918 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:49:41,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:41,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:49:41,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:49:41,918 INFO L87 Difference]: Start difference. First operand 874 states and 3241 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:42,173 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2021-06-05 21:49:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:42,455 INFO L93 Difference]: Finished difference Result 914 states and 3363 transitions. [2021-06-05 21:49:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:42,456 INFO L225 Difference]: With dead ends: 914 [2021-06-05 21:49:42,456 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 21:49:42,457 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 697.5ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:49:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 21:49:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 876. [2021-06-05 21:49:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 3.7142857142857144) internal successors, (3250), 875 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 3250 transitions. [2021-06-05 21:49:42,466 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 3250 transitions. Word has length 18 [2021-06-05 21:49:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:42,466 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 3250 transitions. [2021-06-05 21:49:42,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 3250 transitions. [2021-06-05 21:49:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:42,467 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:42,467 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:42,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 312 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3482 [2021-06-05 21:49:42,667 INFO L430 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:42,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1410421392, now seen corresponding path program 166 times [2021-06-05 21:49:42,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:42,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638271084] [2021-06-05 21:49:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:43,081 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 21:49:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:43,515 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:43,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638271084] [2021-06-05 21:49:43,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638271084] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:43,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880280068] [2021-06-05 21:49:43,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:43,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:49:43,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:43,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:43,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:43,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:43,659 INFO L388 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 12 [2021-06-05 21:49:43,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:43,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:43,663 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:43,664 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:43,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:43,667 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:43,668 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:43,671 INFO L388 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 11 [2021-06-05 21:49:43,672 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:43,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:43,721 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:43,721 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:49:43,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:49:43,899 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:43,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:43,906 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:49:43,906 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:43,906 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:49:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:43,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880280068] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:43,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:43,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:49:43,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744946728] [2021-06-05 21:49:43,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:49:43,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:43,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:49:43,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:49:43,941 INFO L87 Difference]: Start difference. First operand 876 states and 3250 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:44,497 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 21:49:44,751 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2021-06-05 21:49:45,047 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2021-06-05 21:49:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:45,127 INFO L93 Difference]: Finished difference Result 914 states and 3350 transitions. [2021-06-05 21:49:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:45,129 INFO L225 Difference]: With dead ends: 914 [2021-06-05 21:49:45,129 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 21:49:45,129 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1868.7ms TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:49:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 21:49:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 881. [2021-06-05 21:49:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7170454545454548) internal successors, (3271), 880 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3271 transitions. [2021-06-05 21:49:45,138 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3271 transitions. Word has length 18 [2021-06-05 21:49:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:45,139 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3271 transitions. [2021-06-05 21:49:45,139 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3271 transitions. [2021-06-05 21:49:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:45,140 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:45,140 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:45,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 313 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3495 [2021-06-05 21:49:45,340 INFO L430 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash 944557158, now seen corresponding path program 167 times [2021-06-05 21:49:45,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:45,340 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299564132] [2021-06-05 21:49:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:45,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:45,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299564132] [2021-06-05 21:49:45,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299564132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:45,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900430433] [2021-06-05 21:49:45,817 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:45,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:49:45,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:45,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 21:49:45,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:46,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:46,048 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 21:49:46,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 21:49:46,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:46,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:46,056 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:46,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 21:49:46,057 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:46,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:46,063 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:49:46,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 21:49:46,064 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:46,071 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 21:49:46,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 36 [2021-06-05 21:49:46,073 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:46,178 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-05 21:49:46,178 INFO L628 ElimStorePlain]: treesize reduction 8, result has 94.4 percent of original size [2021-06-05 21:49:46,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:46,180 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:211, output treesize:127 [2021-06-05 21:49:46,272 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_874], 1=[array_4, v_prenex_875]} [2021-06-05 21:49:46,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:49:46,276 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:46,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:49:46,279 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:46,323 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.0 percent of original size [2021-06-05 21:49:46,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:49:46,326 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:46,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:46,342 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:49:46,344 INFO L388 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 [2021-06-05 21:49:46,345 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:46,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:46,361 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:46,361 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 21:49:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:46,432 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900430433] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:46,432 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:46,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:49:46,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072086309] [2021-06-05 21:49:46,432 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:49:46,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:49:46,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:49:46,433 INFO L87 Difference]: Start difference. First operand 881 states and 3271 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:46,890 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-06-05 21:49:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:47,197 INFO L93 Difference]: Finished difference Result 937 states and 3411 transitions. [2021-06-05 21:49:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:47,197 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:47,198 INFO L225 Difference]: With dead ends: 937 [2021-06-05 21:49:47,198 INFO L226 Difference]: Without dead ends: 932 [2021-06-05 21:49:47,199 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1132.6ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:49:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-06-05 21:49:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 877. [2021-06-05 21:49:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 21:49:47,208 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 21:49:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:47,208 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 21:49:47,208 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 21:49:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:47,209 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:47,209 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:47,409 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 314 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3509 [2021-06-05 21:49:47,410 INFO L430 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2143112230, now seen corresponding path program 168 times [2021-06-05 21:49:47,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:47,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245197494] [2021-06-05 21:49:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:47,673 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 47 [2021-06-05 21:49:47,924 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 21:49:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:48,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:48,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245197494] [2021-06-05 21:49:48,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245197494] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:48,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629406457] [2021-06-05 21:49:48,266 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:48,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:49:48,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:48,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:48,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:48,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:48,415 INFO L388 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 12 [2021-06-05 21:49:48,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:48,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:48,419 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:48,419 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:48,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:48,423 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:48,423 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:48,426 INFO L388 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 11 [2021-06-05 21:49:48,427 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:48,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:48,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:48,478 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 21:49:48,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:49:48,676 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:48,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:49:48,679 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:48,692 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:49:48,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:49:48,695 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:48,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:48,701 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:48,701 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:49:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:48,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629406457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:48,733 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:48,733 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:49:48,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841996216] [2021-06-05 21:49:48,733 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:49:48,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:49:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:49:48,734 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:49,286 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2021-06-05 21:49:49,735 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 76 [2021-06-05 21:49:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:49,985 INFO L93 Difference]: Finished difference Result 911 states and 3339 transitions. [2021-06-05 21:49:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:49:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:49,987 INFO L225 Difference]: With dead ends: 911 [2021-06-05 21:49:49,987 INFO L226 Difference]: Without dead ends: 906 [2021-06-05 21:49:49,987 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1900.1ms TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:49:49,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-06-05 21:49:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 877. [2021-06-05 21:49:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 21:49:49,997 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 21:49:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:49,997 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 21:49:49,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 21:49:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:49,998 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:49,998 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:50,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3524,315 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:50,198 INFO L430 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1636765964, now seen corresponding path program 169 times [2021-06-05 21:49:50,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:50,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979104781] [2021-06-05 21:49:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:50,632 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2021-06-05 21:49:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:50,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:50,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979104781] [2021-06-05 21:49:50,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979104781] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:50,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925962772] [2021-06-05 21:49:50,754 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:50,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:50,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:50,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:50,933 INFO L388 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 12 [2021-06-05 21:49:50,934 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:50,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:50,937 INFO L388 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 11 [2021-06-05 21:49:50,938 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:50,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:50,941 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:50,942 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:50,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:50,945 INFO L388 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 12 [2021-06-05 21:49:50,945 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:50,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:50,948 INFO L388 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 11 [2021-06-05 21:49:50,949 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:50,952 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:50,952 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:50,999 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:51,000 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:49:51,000 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:139 [2021-06-05 21:49:51,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:49:51,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:51,123 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:51,123 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:49:51,123 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:49:51,124 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:49:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:51,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925962772] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:51,152 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:51,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:49:51,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536625268] [2021-06-05 21:49:51,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:49:51,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:51,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:49:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:49:51,153 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:51,484 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2021-06-05 21:49:51,655 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 21:49:51,826 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-06-05 21:49:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:51,903 INFO L93 Difference]: Finished difference Result 906 states and 3325 transitions. [2021-06-05 21:49:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:49:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:51,905 INFO L225 Difference]: With dead ends: 906 [2021-06-05 21:49:51,905 INFO L226 Difference]: Without dead ends: 901 [2021-06-05 21:49:51,905 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1260.8ms TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:49:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2021-06-05 21:49:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 877. [2021-06-05 21:49:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 21:49:51,921 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 21:49:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:51,921 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 21:49:51,921 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 21:49:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:51,922 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:51,922 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:52,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3539,316 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:52,122 INFO L430 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash 233346690, now seen corresponding path program 170 times [2021-06-05 21:49:52,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:52,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003239669] [2021-06-05 21:49:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:52,361 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2021-06-05 21:49:52,704 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-06-05 21:49:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:52,947 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:52,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003239669] [2021-06-05 21:49:52,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003239669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:52,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638085345] [2021-06-05 21:49:52,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:52,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:49:52,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:52,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:52,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:53,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,108 INFO L388 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 11 [2021-06-05 21:49:53,108 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,111 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:53,112 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,115 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:53,116 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,119 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:53,120 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,158 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:53,159 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:53,159 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:117 [2021-06-05 21:49:53,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,243 INFO L388 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 11 [2021-06-05 21:49:53,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,247 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:53,247 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,251 INFO L388 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 18 treesize of output 14 [2021-06-05 21:49:53,251 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,254 INFO L388 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 29 treesize of output 23 [2021-06-05 21:49:53,255 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,259 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:53,259 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,263 INFO L388 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 30 treesize of output 24 [2021-06-05 21:49:53,264 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,267 INFO L388 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 12 [2021-06-05 21:49:53,267 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,270 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:53,271 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:53,374 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-06-05 21:49:53,374 INFO L628 ElimStorePlain]: treesize reduction 118, result has 50.6 percent of original size [2021-06-05 21:49:53,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,377 INFO L388 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 [2021-06-05 21:49:53,379 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:53,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:53,382 INFO L388 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 12 treesize of output 8 [2021-06-05 21:49:53,383 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:53,386 INFO L388 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 12 treesize of output 8 [2021-06-05 21:49:53,387 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:53,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:53,432 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:49:53,433 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:305, output treesize:97 [2021-06-05 21:49:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:53,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638085345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:53,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:53,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:49:53,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460543703] [2021-06-05 21:49:53,585 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:49:53,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:49:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:49:53,585 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:54,310 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2021-06-05 21:49:54,541 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2021-06-05 21:49:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:54,978 INFO L93 Difference]: Finished difference Result 946 states and 3440 transitions. [2021-06-05 21:49:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:49:54,979 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:54,980 INFO L225 Difference]: With dead ends: 946 [2021-06-05 21:49:54,980 INFO L226 Difference]: Without dead ends: 941 [2021-06-05 21:49:54,980 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1891.0ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-06-05 21:49:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-06-05 21:49:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 881. [2021-06-05 21:49:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.715909090909091) internal successors, (3270), 880 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3270 transitions. [2021-06-05 21:49:54,990 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3270 transitions. Word has length 18 [2021-06-05 21:49:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:54,990 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3270 transitions. [2021-06-05 21:49:54,990 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3270 transitions. [2021-06-05 21:49:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:54,991 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:54,991 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:55,191 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3553,317 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:55,191 INFO L430 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1594902796, now seen corresponding path program 171 times [2021-06-05 21:49:55,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:55,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790468118] [2021-06-05 21:49:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:55,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:55,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790468118] [2021-06-05 21:49:55,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790468118] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:55,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418870748] [2021-06-05 21:49:55,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:55,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:49:55,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:55,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:49:55,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:56,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,001 INFO L388 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 11 [2021-06-05 21:49:56,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,005 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:56,006 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,009 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:56,010 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,012 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:56,013 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:56,052 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:56,052 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:117 [2021-06-05 21:49:56,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,135 INFO L388 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 11 [2021-06-05 21:49:56,136 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,139 INFO L388 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 29 treesize of output 23 [2021-06-05 21:49:56,140 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,143 INFO L388 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 30 treesize of output 24 [2021-06-05 21:49:56,144 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,156 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:56,157 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,160 INFO L388 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 18 treesize of output 14 [2021-06-05 21:49:56,161 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,164 INFO L388 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 26 treesize of output 20 [2021-06-05 21:49:56,165 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,168 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:56,169 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,172 INFO L388 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 12 [2021-06-05 21:49:56,172 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:56,276 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2021-06-05 21:49:56,276 INFO L628 ElimStorePlain]: treesize reduction 122, result has 48.1 percent of original size [2021-06-05 21:49:56,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:56,279 INFO L388 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 [2021-06-05 21:49:56,281 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:56,283 INFO L388 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 12 treesize of output 8 [2021-06-05 21:49:56,284 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:56,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:56,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:49:56,330 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:305, output treesize:97 [2021-06-05 21:49:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:56,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418870748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:56,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:49:56,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:49:56,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520464874] [2021-06-05 21:49:56,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:49:56,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:49:56,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:49:56,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:49:56,522 INFO L87 Difference]: Start difference. First operand 881 states and 3270 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:56,860 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 54 [2021-06-05 21:49:57,050 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2021-06-05 21:49:57,657 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2021-06-05 21:49:57,871 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 21:49:58,334 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2021-06-05 21:49:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:49:58,504 INFO L93 Difference]: Finished difference Result 928 states and 3392 transitions. [2021-06-05 21:49:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:49:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:49:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:49:58,506 INFO L225 Difference]: With dead ends: 928 [2021-06-05 21:49:58,506 INFO L226 Difference]: Without dead ends: 922 [2021-06-05 21:49:58,506 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2391.2ms TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-06-05 21:49:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-06-05 21:49:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 879. [2021-06-05 21:49:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.715261958997722) internal successors, (3262), 878 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3262 transitions. [2021-06-05 21:49:58,515 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3262 transitions. Word has length 18 [2021-06-05 21:49:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:49:58,515 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3262 transitions. [2021-06-05 21:49:58,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:49:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3262 transitions. [2021-06-05 21:49:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:49:58,516 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:49:58,516 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:49:58,717 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3569,318 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:58,717 INFO L430 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:49:58,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:49:58,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2132758374, now seen corresponding path program 172 times [2021-06-05 21:49:58,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:49:58,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38610453] [2021-06-05 21:49:58,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:49:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:49:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:49:59,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:49:59,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38610453] [2021-06-05 21:49:59,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38610453] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:49:59,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621043420] [2021-06-05 21:49:59,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:49:59,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:49:59,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:49:59,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:49:59,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:49:59,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,327 INFO L388 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 11 [2021-06-05 21:49:59,327 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,331 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:59,331 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,335 INFO L388 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 25 treesize of output 19 [2021-06-05 21:49:59,336 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,338 INFO L388 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 35 treesize of output 27 [2021-06-05 21:49:59,339 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:59,391 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:49:59,391 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:169, output treesize:131 [2021-06-05 21:49:59,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,568 INFO L388 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 12 [2021-06-05 21:49:59,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,574 INFO L388 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 11 [2021-06-05 21:49:59,575 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,580 INFO L388 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 18 treesize of output 14 [2021-06-05 21:49:59,581 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,586 INFO L388 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 18 treesize of output 14 [2021-06-05 21:49:59,587 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,592 INFO L388 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 30 treesize of output 24 [2021-06-05 21:49:59,593 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,598 INFO L388 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 18 treesize of output 14 [2021-06-05 21:49:59,599 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,605 INFO L388 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 11 [2021-06-05 21:49:59,606 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,611 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:59,612 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,617 INFO L388 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 12 [2021-06-05 21:49:59,617 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,622 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:59,623 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,628 INFO L388 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 17 treesize of output 13 [2021-06-05 21:49:59,629 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,632 INFO L388 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 29 treesize of output 23 [2021-06-05 21:49:59,633 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,791 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2021-06-05 21:49:59,792 INFO L628 ElimStorePlain]: treesize reduction 201, result has 46.7 percent of original size [2021-06-05 21:49:59,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,795 INFO L388 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 12 treesize of output 8 [2021-06-05 21:49:59,796 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:59,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:49:59,799 INFO L388 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 22 treesize of output 14 [2021-06-05 21:49:59,800 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 21:49:59,803 INFO L388 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 10 treesize of output 6 [2021-06-05 21:49:59,804 INFO L550 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:49:59,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:49:59,871 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 21:49:59,871 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 2 variables, input treesize:461, output treesize:148 [2021-06-05 21:50:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:00,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621043420] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:00,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:00,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 21:50:00,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984090903] [2021-06-05 21:50:00,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:50:00,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:00,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:50:00,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:50:00,040 INFO L87 Difference]: Start difference. First operand 879 states and 3262 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:00,515 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-06-05 21:50:00,773 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 61 [2021-06-05 21:50:00,999 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2021-06-05 21:50:01,292 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2021-06-05 21:50:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:01,409 INFO L93 Difference]: Finished difference Result 913 states and 3340 transitions. [2021-06-05 21:50:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:50:01,409 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:01,411 INFO L225 Difference]: With dead ends: 913 [2021-06-05 21:50:01,411 INFO L226 Difference]: Without dead ends: 902 [2021-06-05 21:50:01,411 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1807.8ms TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2021-06-05 21:50:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 880. [2021-06-05 21:50:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7110352673492604) internal successors, (3262), 879 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3262 transitions. [2021-06-05 21:50:01,420 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3262 transitions. Word has length 18 [2021-06-05 21:50:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:01,420 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3262 transitions. [2021-06-05 21:50:01,420 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3262 transitions. [2021-06-05 21:50:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:01,422 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:01,422 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:01,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 319 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3587 [2021-06-05 21:50:01,625 INFO L430 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2089126690, now seen corresponding path program 173 times [2021-06-05 21:50:01,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:01,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021939413] [2021-06-05 21:50:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:02,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:02,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021939413] [2021-06-05 21:50:02,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021939413] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:02,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728882275] [2021-06-05 21:50:02,375 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:02,404 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:50:02,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:02,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:02,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:02,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:02,511 INFO L388 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 12 [2021-06-05 21:50:02,511 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:02,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:02,515 INFO L388 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 11 [2021-06-05 21:50:02,515 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:02,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:02,518 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:02,519 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:02,522 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:02,523 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:02,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:02,562 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:02,562 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 21:50:02,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:02,695 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:02,696 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:02,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:02,698 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:02,699 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:02,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:02,702 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:02,703 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:02,706 INFO L388 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 11 [2021-06-05 21:50:02,707 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:02,759 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 21:50:02,762 INFO L388 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 [2021-06-05 21:50:02,764 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:02,783 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:02,784 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:02,784 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:50:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:02,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728882275] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:02,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:02,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:50:02,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121333876] [2021-06-05 21:50:02,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:50:02,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:02,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:50:02,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:50:02,859 INFO L87 Difference]: Start difference. First operand 880 states and 3262 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:03,428 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2021-06-05 21:50:03,649 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-06-05 21:50:03,978 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-06-05 21:50:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:04,055 INFO L93 Difference]: Finished difference Result 919 states and 3375 transitions. [2021-06-05 21:50:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:04,055 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:04,056 INFO L225 Difference]: With dead ends: 919 [2021-06-05 21:50:04,056 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 21:50:04,057 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1650.9ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:50:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 21:50:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 883. [2021-06-05 21:50:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 21:50:04,066 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 21:50:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:04,066 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 21:50:04,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 21:50:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:04,067 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:04,067 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:04,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3602,320 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:04,268 INFO L430 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:04,268 INFO L82 PathProgramCache]: Analyzing trace with hash 214606282, now seen corresponding path program 174 times [2021-06-05 21:50:04,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:04,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033345171] [2021-06-05 21:50:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:04,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:04,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033345171] [2021-06-05 21:50:04,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033345171] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:04,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71704789] [2021-06-05 21:50:04,484 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:04,511 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:50:04,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:04,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:04,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:04,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:04,618 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:04,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:04,622 INFO L388 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 11 [2021-06-05 21:50:04,622 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:04,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:04,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:04,646 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 21:50:04,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:50:04,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:04,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:04,738 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:50:04,739 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:04,739 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:50:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:04,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71704789] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:04,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:04,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:04,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787933319] [2021-06-05 21:50:04,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:04,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:04,767 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:05,287 INFO L93 Difference]: Finished difference Result 964 states and 3516 transitions. [2021-06-05 21:50:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:05,289 INFO L225 Difference]: With dead ends: 964 [2021-06-05 21:50:05,289 INFO L226 Difference]: Without dead ends: 959 [2021-06-05 21:50:05,289 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 558.7ms TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:50:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-06-05 21:50:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 892. [2021-06-05 21:50:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 3.705948372615039) internal successors, (3302), 891 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 3302 transitions. [2021-06-05 21:50:05,299 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 3302 transitions. Word has length 18 [2021-06-05 21:50:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:05,300 INFO L482 AbstractCegarLoop]: Abstraction has 892 states and 3302 transitions. [2021-06-05 21:50:05,300 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 3302 transitions. [2021-06-05 21:50:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:05,301 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:05,301 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:05,501 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3617,321 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:05,501 INFO L430 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1725382464, now seen corresponding path program 175 times [2021-06-05 21:50:05,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:05,502 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113436929] [2021-06-05 21:50:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:05,737 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:05,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113436929] [2021-06-05 21:50:05,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113436929] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:05,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607461887] [2021-06-05 21:50:05,737 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:05,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 21:50:05,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:05,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:05,895 INFO L388 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 11 [2021-06-05 21:50:05,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:05,898 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:05,899 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:05,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:05,926 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:05,926 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 21:50:05,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:05,990 INFO L388 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 11 [2021-06-05 21:50:05,991 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:05,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:05,994 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:05,995 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:05,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:05,998 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:05,998 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:06,001 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:06,002 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:06,062 INFO L628 ElimStorePlain]: treesize reduction 85, result has 40.6 percent of original size [2021-06-05 21:50:06,064 INFO L388 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 [2021-06-05 21:50:06,066 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:06,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:06,091 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:06,092 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 21:50:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:06,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607461887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:06,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:06,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 21:50:06,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114035769] [2021-06-05 21:50:06,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:50:06,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:06,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:50:06,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:50:06,218 INFO L87 Difference]: Start difference. First operand 892 states and 3302 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:06,920 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2021-06-05 21:50:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:07,102 INFO L93 Difference]: Finished difference Result 974 states and 3541 transitions. [2021-06-05 21:50:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:07,102 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:07,104 INFO L225 Difference]: With dead ends: 974 [2021-06-05 21:50:07,104 INFO L226 Difference]: Without dead ends: 962 [2021-06-05 21:50:07,104 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 947.9ms TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-06-05 21:50:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 889. [2021-06-05 21:50:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 3.704954954954955) internal successors, (3290), 888 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3290 transitions. [2021-06-05 21:50:07,114 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3290 transitions. Word has length 18 [2021-06-05 21:50:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:07,114 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 3290 transitions. [2021-06-05 21:50:07,114 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3290 transitions. [2021-06-05 21:50:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:07,115 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:07,115 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:07,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 322 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3627 [2021-06-05 21:50:07,316 INFO L430 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1695844152, now seen corresponding path program 176 times [2021-06-05 21:50:07,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:07,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610916489] [2021-06-05 21:50:07,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:07,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:07,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610916489] [2021-06-05 21:50:07,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610916489] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:07,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254001139] [2021-06-05 21:50:07,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:07,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:07,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:07,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:07,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:07,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:07,802 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:07,803 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:07,805 INFO L388 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 11 [2021-06-05 21:50:07,806 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:07,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:07,829 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:07,829 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 21:50:07,881 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_876], 1=[v_prenex_877, array_4]} [2021-06-05 21:50:07,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:50:07,885 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:07,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:50:07,888 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:07,933 INFO L628 ElimStorePlain]: treesize reduction 75, result has 41.9 percent of original size [2021-06-05 21:50:07,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:50:07,936 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:07,951 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:07,954 INFO L388 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 [2021-06-05 21:50:07,955 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:07,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:07,970 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:50:07,971 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:07,971 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 21:50:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:08,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254001139] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:08,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:08,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:08,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580511055] [2021-06-05 21:50:08,039 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:08,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:08,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:08,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:08,040 INFO L87 Difference]: Start difference. First operand 889 states and 3290 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:08,796 INFO L93 Difference]: Finished difference Result 982 states and 3566 transitions. [2021-06-05 21:50:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:08,796 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:08,798 INFO L225 Difference]: With dead ends: 982 [2021-06-05 21:50:08,798 INFO L226 Difference]: Without dead ends: 977 [2021-06-05 21:50:08,798 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 880.8ms TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:50:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-06-05 21:50:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 892. [2021-06-05 21:50:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 3.705948372615039) internal successors, (3302), 891 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 3302 transitions. [2021-06-05 21:50:08,807 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 3302 transitions. Word has length 18 [2021-06-05 21:50:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:08,807 INFO L482 AbstractCegarLoop]: Abstraction has 892 states and 3302 transitions. [2021-06-05 21:50:08,807 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 3302 transitions. [2021-06-05 21:50:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:08,808 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:08,808 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:09,009 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3637,323 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:09,009 INFO L430 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash 24868136, now seen corresponding path program 177 times [2021-06-05 21:50:09,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:09,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627937931] [2021-06-05 21:50:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:09,256 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:09,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627937931] [2021-06-05 21:50:09,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627937931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:09,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273428831] [2021-06-05 21:50:09,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:09,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:50:09,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:09,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:09,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:09,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:09,397 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:09,398 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:09,400 INFO L388 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 11 [2021-06-05 21:50:09,401 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:09,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:09,425 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:09,425 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 21:50:09,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:50:09,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:09,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:09,515 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:50:09,515 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:09,515 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:50:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:09,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273428831] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:09,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:09,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:09,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635237283] [2021-06-05 21:50:09,544 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:09,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:09,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:09,545 INFO L87 Difference]: Start difference. First operand 892 states and 3302 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:10,035 INFO L93 Difference]: Finished difference Result 965 states and 3523 transitions. [2021-06-05 21:50:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:10,037 INFO L225 Difference]: With dead ends: 965 [2021-06-05 21:50:10,037 INFO L226 Difference]: Without dead ends: 960 [2021-06-05 21:50:10,037 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 556.5ms TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:50:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-06-05 21:50:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 886. [2021-06-05 21:50:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7073446327683617) internal successors, (3281), 885 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3281 transitions. [2021-06-05 21:50:10,047 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3281 transitions. Word has length 18 [2021-06-05 21:50:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:10,047 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3281 transitions. [2021-06-05 21:50:10,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3281 transitions. [2021-06-05 21:50:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:10,048 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:10,048 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:10,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 324 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3648 [2021-06-05 21:50:10,248 INFO L430 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:10,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1124389346, now seen corresponding path program 178 times [2021-06-05 21:50:10,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:10,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431866494] [2021-06-05 21:50:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:10,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:10,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431866494] [2021-06-05 21:50:10,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431866494] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:10,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401158370] [2021-06-05 21:50:10,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:10,487 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:50:10,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:10,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:10,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:10,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:50:10,587 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:10,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:50:10,590 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:10,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:10,600 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:10,601 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:34 [2021-06-05 21:50:10,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:10,673 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:10,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:10,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:10,677 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:10,677 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:10,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:10,680 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:10,681 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:10,683 INFO L388 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 11 [2021-06-05 21:50:10,684 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:10,723 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 21:50:10,725 INFO L388 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 [2021-06-05 21:50:10,727 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:10,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:10,743 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:10,743 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:50:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:10,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401158370] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:10,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:10,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:10,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112933604] [2021-06-05 21:50:10,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:10,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:10,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:10,818 INFO L87 Difference]: Start difference. First operand 886 states and 3281 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:11,543 INFO L93 Difference]: Finished difference Result 1055 states and 3833 transitions. [2021-06-05 21:50:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:50:11,543 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:11,545 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 21:50:11,545 INFO L226 Difference]: Without dead ends: 1050 [2021-06-05 21:50:11,545 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 702.3ms TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:50:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-06-05 21:50:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 883. [2021-06-05 21:50:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 21:50:11,556 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 21:50:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:11,556 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 21:50:11,556 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 21:50:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:11,557 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:11,557 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:11,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3658,325 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:11,758 INFO L430 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1083309636, now seen corresponding path program 179 times [2021-06-05 21:50:11,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:11,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798592944] [2021-06-05 21:50:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:11,946 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:11,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798592944] [2021-06-05 21:50:11,946 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798592944] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:11,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161166469] [2021-06-05 21:50:11,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:11,975 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:11,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:11,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:11,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:12,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:12,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:12,114 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:12,116 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:12,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:12,120 INFO L388 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 11 [2021-06-05 21:50:12,121 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:12,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:12,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:50:12,162 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:85 [2021-06-05 21:50:12,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:12,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:12,336 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:12,337 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:12,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:12,341 INFO L388 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 11 [2021-06-05 21:50:12,341 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:12,393 INFO L628 ElimStorePlain]: treesize reduction 79, result has 45.1 percent of original size [2021-06-05 21:50:12,396 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:12,396 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:12,397 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:12,414 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:12,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:12,417 INFO L388 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 [2021-06-05 21:50:12,418 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:12,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:12,434 INFO L518 ElimStorePlain]: Eliminatee v_prenex_880 vanished before elimination [2021-06-05 21:50:12,436 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:12,436 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:162, output treesize:16 [2021-06-05 21:50:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:12,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161166469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:12,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:12,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:50:12,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480686350] [2021-06-05 21:50:12,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:50:12,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:50:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:50:12,453 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:12,743 INFO L93 Difference]: Finished difference Result 925 states and 3382 transitions. [2021-06-05 21:50:12,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:12,744 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:12,745 INFO L225 Difference]: With dead ends: 925 [2021-06-05 21:50:12,745 INFO L226 Difference]: Without dead ends: 920 [2021-06-05 21:50:12,745 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 374.9ms TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:50:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-06-05 21:50:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 889. [2021-06-05 21:50:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 3.7083333333333335) internal successors, (3293), 888 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3293 transitions. [2021-06-05 21:50:12,755 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3293 transitions. Word has length 18 [2021-06-05 21:50:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:12,755 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 3293 transitions. [2021-06-05 21:50:12,755 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3293 transitions. [2021-06-05 21:50:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:12,756 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:12,756 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:12,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 326 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3668 [2021-06-05 21:50:12,956 INFO L430 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:12,957 INFO L82 PathProgramCache]: Analyzing trace with hash -856679110, now seen corresponding path program 180 times [2021-06-05 21:50:12,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:12,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410431702] [2021-06-05 21:50:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:13,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:13,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410431702] [2021-06-05 21:50:13,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410431702] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:13,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248116215] [2021-06-05 21:50:13,130 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:13,174 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:50:13,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:13,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:13,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:13,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:13,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:13,337 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:13,338 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:13,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:13,342 INFO L388 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 11 [2021-06-05 21:50:13,343 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:13,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:13,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:50:13,383 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:81 [2021-06-05 21:50:13,476 INFO L446 ElimStorePlain]: Different costs {1=[array_4, v_prenex_886], 3=[array_2, v_prenex_884]} [2021-06-05 21:50:13,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:13,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:13,481 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:13,482 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:13,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:13,486 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:13,487 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:13,554 INFO L628 ElimStorePlain]: treesize reduction 103, result has 44.9 percent of original size [2021-06-05 21:50:13,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:50:13,558 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:13,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:13,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:13,588 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:13,589 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:13,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:13,614 INFO L518 ElimStorePlain]: Eliminatee v_prenex_884 vanished before elimination [2021-06-05 21:50:13,615 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:13,615 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:199, output treesize:35 [2021-06-05 21:50:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:13,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248116215] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:13,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:13,667 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:50:13,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32093012] [2021-06-05 21:50:13,667 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:50:13,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:13,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:50:13,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:50:13,668 INFO L87 Difference]: Start difference. First operand 889 states and 3293 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:13,920 INFO L93 Difference]: Finished difference Result 935 states and 3414 transitions. [2021-06-05 21:50:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:13,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:13,922 INFO L225 Difference]: With dead ends: 935 [2021-06-05 21:50:13,922 INFO L226 Difference]: Without dead ends: 930 [2021-06-05 21:50:13,922 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 373.4ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:50:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2021-06-05 21:50:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 886. [2021-06-05 21:50:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7073446327683617) internal successors, (3281), 885 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3281 transitions. [2021-06-05 21:50:13,932 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3281 transitions. Word has length 18 [2021-06-05 21:50:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:13,932 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3281 transitions. [2021-06-05 21:50:13,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3281 transitions. [2021-06-05 21:50:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:13,933 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:13,933 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:14,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3695,327 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:14,134 INFO L430 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:14,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1730419790, now seen corresponding path program 181 times [2021-06-05 21:50:14,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:14,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469010898] [2021-06-05 21:50:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:14,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:14,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469010898] [2021-06-05 21:50:14,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469010898] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:14,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476183123] [2021-06-05 21:50:14,343 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:14,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:50:14,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:14,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,508 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:14,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:14,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,511 INFO L388 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 11 [2021-06-05 21:50:14,512 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:14,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:14,548 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 21:50:14,548 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:82 [2021-06-05 21:50:14,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,649 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:14,650 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:14,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,655 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:14,656 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:14,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,660 INFO L388 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 11 [2021-06-05 21:50:14,661 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:14,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,665 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:14,666 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:14,728 INFO L628 ElimStorePlain]: treesize reduction 102, result has 41.0 percent of original size [2021-06-05 21:50:14,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:14,732 INFO L388 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 [2021-06-05 21:50:14,733 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:14,759 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:14,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:14,761 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:207, output treesize:35 [2021-06-05 21:50:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:14,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476183123] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:14,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:14,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:50:14,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706547494] [2021-06-05 21:50:14,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:50:14,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:14,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:50:14,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:50:14,824 INFO L87 Difference]: Start difference. First operand 886 states and 3281 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:15,240 INFO L93 Difference]: Finished difference Result 930 states and 3404 transitions. [2021-06-05 21:50:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:15,242 INFO L225 Difference]: With dead ends: 930 [2021-06-05 21:50:15,242 INFO L226 Difference]: Without dead ends: 925 [2021-06-05 21:50:15,242 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 456.8ms TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:50:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-06-05 21:50:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 883. [2021-06-05 21:50:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 21:50:15,252 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 21:50:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:15,252 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 21:50:15,252 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 21:50:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:15,253 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:15,253 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:15,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3708,328 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:15,454 INFO L430 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:15,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:15,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1181503380, now seen corresponding path program 182 times [2021-06-05 21:50:15,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:15,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098642677] [2021-06-05 21:50:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:15,820 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:15,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098642677] [2021-06-05 21:50:15,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098642677] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:15,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659506759] [2021-06-05 21:50:15,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:15,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:15,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:15,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:15,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:15,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:15,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:15,936 INFO L388 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 12 [2021-06-05 21:50:15,937 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:15,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:15,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:15,941 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:15,942 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:15,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:15,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:15,945 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:15,946 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:15,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:15,950 INFO L388 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 11 [2021-06-05 21:50:15,950 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:16,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:16,015 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:16,015 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:205, output treesize:173 [2021-06-05 21:50:16,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:16,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:16,362 INFO L388 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 11 [2021-06-05 21:50:16,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:16,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:16,366 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:16,366 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:16,420 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.9 percent of original size [2021-06-05 21:50:16,420 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:50:16,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:16,423 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:16,424 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:16,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:16,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:16,443 INFO L388 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 [2021-06-05 21:50:16,445 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:16,461 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:16,462 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:16,462 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:162, output treesize:16 [2021-06-05 21:50:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:16,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659506759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:16,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:16,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 21:50:16,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427404524] [2021-06-05 21:50:16,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:50:16,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:50:16,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:50:16,493 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:16,860 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 21:50:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:17,254 INFO L93 Difference]: Finished difference Result 928 states and 3388 transitions. [2021-06-05 21:50:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:17,256 INFO L225 Difference]: With dead ends: 928 [2021-06-05 21:50:17,256 INFO L226 Difference]: Without dead ends: 923 [2021-06-05 21:50:17,256 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1039.8ms TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:50:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-06-05 21:50:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 887. [2021-06-05 21:50:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.7121896162528216) internal successors, (3289), 886 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3289 transitions. [2021-06-05 21:50:17,266 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3289 transitions. Word has length 18 [2021-06-05 21:50:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:17,266 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3289 transitions. [2021-06-05 21:50:17,266 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3289 transitions. [2021-06-05 21:50:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:17,267 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:17,267 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:17,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 329 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3722 [2021-06-05 21:50:17,468 INFO L430 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1173475170, now seen corresponding path program 183 times [2021-06-05 21:50:17,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:17,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375173337] [2021-06-05 21:50:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:17,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:17,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375173337] [2021-06-05 21:50:17,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375173337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:17,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714695222] [2021-06-05 21:50:17,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:17,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:50:17,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:17,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:17,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:17,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:17,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:17,838 INFO L388 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 12 [2021-06-05 21:50:17,839 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:17,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:17,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:17,842 INFO L388 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 11 [2021-06-05 21:50:17,843 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:17,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:17,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:17,847 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:17,848 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:17,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:17,851 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:17,852 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:17,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:17,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:17,903 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:187, output treesize:155 [2021-06-05 21:50:18,173 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 21:50:18,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:18,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:18,177 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:18,178 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:18,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:18,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:18,182 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:18,183 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:18,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:18,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:18,187 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:18,188 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:18,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:18,191 INFO L388 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 11 [2021-06-05 21:50:18,192 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:18,257 INFO L628 ElimStorePlain]: treesize reduction 95, result has 41.7 percent of original size [2021-06-05 21:50:18,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:18,260 INFO L388 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 [2021-06-05 21:50:18,262 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:18,284 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:18,286 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:18,286 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:201, output treesize:75 [2021-06-05 21:50:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:18,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714695222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:18,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:18,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:50:18,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430457642] [2021-06-05 21:50:18,378 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:50:18,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:18,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:50:18,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:50:18,378 INFO L87 Difference]: Start difference. First operand 887 states and 3289 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:18,713 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-06-05 21:50:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:19,066 INFO L93 Difference]: Finished difference Result 944 states and 3442 transitions. [2021-06-05 21:50:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:19,078 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:19,079 INFO L225 Difference]: With dead ends: 944 [2021-06-05 21:50:19,079 INFO L226 Difference]: Without dead ends: 939 [2021-06-05 21:50:19,080 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 848.8ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:50:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2021-06-05 21:50:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 883. [2021-06-05 21:50:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 21:50:19,089 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 21:50:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:19,089 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 21:50:19,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 21:50:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:19,090 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:19,091 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:19,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3751,330 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:19,291 INFO L430 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:19,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:19,291 INFO L82 PathProgramCache]: Analyzing trace with hash -974410398, now seen corresponding path program 184 times [2021-06-05 21:50:19,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:19,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440663781] [2021-06-05 21:50:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:19,549 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:19,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440663781] [2021-06-05 21:50:19,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440663781] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:19,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936061632] [2021-06-05 21:50:19,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:19,577 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:50:19,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:19,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:19,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:19,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:19,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:19,695 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:19,696 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:19,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:19,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:19,700 INFO L388 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 12 [2021-06-05 21:50:19,700 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:19,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:19,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:19,704 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:19,705 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:19,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:19,708 INFO L388 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 11 [2021-06-05 21:50:19,709 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:19,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:19,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:50:19,770 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:157 [2021-06-05 21:50:20,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:20,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:20,044 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:20,044 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:20,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:20,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:20,049 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:20,049 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:20,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:20,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:20,054 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:20,054 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:20,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:20,058 INFO L388 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 11 [2021-06-05 21:50:20,059 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:20,132 INFO L628 ElimStorePlain]: treesize reduction 102, result has 41.0 percent of original size [2021-06-05 21:50:20,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:20,136 INFO L388 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 [2021-06-05 21:50:20,137 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:20,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:20,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:20,164 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:199, output treesize:35 [2021-06-05 21:50:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:20,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936061632] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:20,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:20,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:50:20,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997287223] [2021-06-05 21:50:20,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:50:20,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:20,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:50:20,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:50:20,231 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:20,519 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2021-06-05 21:50:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:20,794 INFO L93 Difference]: Finished difference Result 932 states and 3416 transitions. [2021-06-05 21:50:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:20,794 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:20,796 INFO L225 Difference]: With dead ends: 932 [2021-06-05 21:50:20,796 INFO L226 Difference]: Without dead ends: 927 [2021-06-05 21:50:20,796 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 747.1ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:50:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2021-06-05 21:50:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 884. [2021-06-05 21:50:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.710079275198188) internal successors, (3276), 883 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3276 transitions. [2021-06-05 21:50:20,806 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3276 transitions. Word has length 18 [2021-06-05 21:50:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:20,806 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3276 transitions. [2021-06-05 21:50:20,806 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3276 transitions. [2021-06-05 21:50:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:20,807 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:20,807 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:21,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 331 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3778 [2021-06-05 21:50:21,007 INFO L430 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1209123278, now seen corresponding path program 185 times [2021-06-05 21:50:21,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:21,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076593211] [2021-06-05 21:50:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:21,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:21,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076593211] [2021-06-05 21:50:21,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076593211] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:21,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972398801] [2021-06-05 21:50:21,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:21,341 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:21,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:21,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:21,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:21,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:21,412 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:21,413 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:21,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:21,416 INFO L388 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 11 [2021-06-05 21:50:21,417 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:21,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:21,419 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:21,420 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:21,422 INFO L388 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 12 [2021-06-05 21:50:21,423 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:21,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:21,450 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:21,450 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 21:50:21,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:21,574 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:21,575 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:21,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:21,578 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:21,579 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:21,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:21,582 INFO L388 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 11 [2021-06-05 21:50:21,582 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:21,585 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:21,585 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:21,625 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 21:50:21,627 INFO L388 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 [2021-06-05 21:50:21,629 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:21,644 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:21,644 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:21,645 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:50:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:21,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972398801] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:21,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:21,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:21,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554370960] [2021-06-05 21:50:21,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:21,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:21,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:21,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:21,714 INFO L87 Difference]: Start difference. First operand 884 states and 3276 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:22,612 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 21:50:22,756 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2021-06-05 21:50:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:22,829 INFO L93 Difference]: Finished difference Result 1062 states and 3819 transitions. [2021-06-05 21:50:22,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:50:22,830 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:22,831 INFO L225 Difference]: With dead ends: 1062 [2021-06-05 21:50:22,831 INFO L226 Difference]: Without dead ends: 1057 [2021-06-05 21:50:22,832 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1141.1ms TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-06-05 21:50:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 886. [2021-06-05 21:50:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7096045197740115) internal successors, (3283), 885 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3283 transitions. [2021-06-05 21:50:22,842 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3283 transitions. Word has length 18 [2021-06-05 21:50:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:22,842 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3283 transitions. [2021-06-05 21:50:22,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3283 transitions. [2021-06-05 21:50:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:22,843 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:22,843 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:23,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 332 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3805 [2021-06-05 21:50:23,044 INFO L430 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:23,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:23,044 INFO L82 PathProgramCache]: Analyzing trace with hash 65825400, now seen corresponding path program 186 times [2021-06-05 21:50:23,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:23,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983123822] [2021-06-05 21:50:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:23,339 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:23,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983123822] [2021-06-05 21:50:23,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983123822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:23,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822502128] [2021-06-05 21:50:23,339 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:23,367 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:50:23,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:23,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:23,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:23,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:23,434 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:23,435 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:23,437 INFO L388 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 11 [2021-06-05 21:50:23,438 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:23,441 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:23,442 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,444 INFO L388 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 12 [2021-06-05 21:50:23,444 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,479 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:23,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:23,480 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:75 [2021-06-05 21:50:23,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:23,629 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:23,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:23,633 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:23,633 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:23,636 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:23,637 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,639 INFO L388 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 11 [2021-06-05 21:50:23,640 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,679 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 21:50:23,681 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:23,682 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:23,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:23,698 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:23,698 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:50:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:23,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822502128] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:23,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:23,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:23,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653282790] [2021-06-05 21:50:23,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:23,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:23,767 INFO L87 Difference]: Start difference. First operand 886 states and 3283 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:24,471 INFO L93 Difference]: Finished difference Result 978 states and 3533 transitions. [2021-06-05 21:50:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:24,471 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:24,473 INFO L225 Difference]: With dead ends: 978 [2021-06-05 21:50:24,473 INFO L226 Difference]: Without dead ends: 973 [2021-06-05 21:50:24,473 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 860.3ms TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:50:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-06-05 21:50:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 884. [2021-06-05 21:50:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.711211778029445) internal successors, (3277), 883 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3277 transitions. [2021-06-05 21:50:24,483 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3277 transitions. Word has length 18 [2021-06-05 21:50:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:24,483 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3277 transitions. [2021-06-05 21:50:24,483 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3277 transitions. [2021-06-05 21:50:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:24,484 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:24,484 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:24,684 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 333 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3819 [2021-06-05 21:50:24,684 INFO L430 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash 660823910, now seen corresponding path program 187 times [2021-06-05 21:50:24,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:24,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673882189] [2021-06-05 21:50:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:24,899 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:24,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673882189] [2021-06-05 21:50:24,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673882189] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:24,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462994706] [2021-06-05 21:50:24,899 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:24,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:50:24,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:25,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,054 INFO L388 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 11 [2021-06-05 21:50:25,054 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:25,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,058 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:25,058 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:25,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:25,102 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:50:25,102 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:97 [2021-06-05 21:50:25,241 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_2]} [2021-06-05 21:50:25,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,246 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:25,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:25,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,252 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:25,253 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:25,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,257 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:25,258 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:25,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,262 INFO L388 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 11 [2021-06-05 21:50:25,263 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:25,320 INFO L628 ElimStorePlain]: treesize reduction 96, result has 44.5 percent of original size [2021-06-05 21:50:25,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:25,323 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:25,324 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:25,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:25,350 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:25,350 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:207, output treesize:78 [2021-06-05 21:50:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:25,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462994706] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:25,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:25,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 21:50:25,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772387441] [2021-06-05 21:50:25,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:50:25,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:25,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:50:25,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:50:25,445 INFO L87 Difference]: Start difference. First operand 884 states and 3277 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:25,705 INFO L93 Difference]: Finished difference Result 917 states and 3361 transitions. [2021-06-05 21:50:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:25,707 INFO L225 Difference]: With dead ends: 917 [2021-06-05 21:50:25,707 INFO L226 Difference]: Without dead ends: 904 [2021-06-05 21:50:25,707 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 469.4ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:50:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-06-05 21:50:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 890. [2021-06-05 21:50:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 3.706411698537683) internal successors, (3295), 889 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3295 transitions. [2021-06-05 21:50:25,717 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3295 transitions. Word has length 18 [2021-06-05 21:50:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:25,717 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 3295 transitions. [2021-06-05 21:50:25,717 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3295 transitions. [2021-06-05 21:50:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:25,718 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:25,718 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:25,918 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3833,334 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:25,918 INFO L430 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1279164836, now seen corresponding path program 188 times [2021-06-05 21:50:25,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:25,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514833404] [2021-06-05 21:50:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:26,127 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:26,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514833404] [2021-06-05 21:50:26,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514833404] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:26,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589473351] [2021-06-05 21:50:26,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:26,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:26,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:26,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:26,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:26,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:26,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:26,276 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:26,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:26,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:26,280 INFO L388 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 11 [2021-06-05 21:50:26,280 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:26,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:26,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:50:26,317 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:81 [2021-06-05 21:50:26,408 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_914, array_4], 3=[v_prenex_913, array_2]} [2021-06-05 21:50:26,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:26,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:26,413 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:26,414 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:26,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:26,418 INFO L388 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 11 [2021-06-05 21:50:26,419 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:26,504 INFO L628 ElimStorePlain]: treesize reduction 109, result has 41.7 percent of original size [2021-06-05 21:50:26,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:26,508 INFO L388 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 19 treesize of output 15 [2021-06-05 21:50:26,509 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:26,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:26,535 INFO L518 ElimStorePlain]: Eliminatee v_prenex_913 vanished before elimination [2021-06-05 21:50:26,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:26,538 INFO L388 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 12 treesize of output 8 [2021-06-05 21:50:26,540 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:26,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:26,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:26,567 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:199, output treesize:35 [2021-06-05 21:50:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:26,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589473351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:26,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:26,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:50:26,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935230434] [2021-06-05 21:50:26,619 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:50:26,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:26,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:50:26,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:50:26,619 INFO L87 Difference]: Start difference. First operand 890 states and 3295 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:26,945 INFO L93 Difference]: Finished difference Result 919 states and 3378 transitions. [2021-06-05 21:50:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:26,947 INFO L225 Difference]: With dead ends: 919 [2021-06-05 21:50:26,947 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 21:50:26,947 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 380.6ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:50:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 21:50:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 887. [2021-06-05 21:50:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.708803611738149) internal successors, (3286), 886 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3286 transitions. [2021-06-05 21:50:26,956 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3286 transitions. Word has length 18 [2021-06-05 21:50:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:26,956 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3286 transitions. [2021-06-05 21:50:26,956 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3286 transitions. [2021-06-05 21:50:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:26,957 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:26,957 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:27,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 335 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3847 [2021-06-05 21:50:27,158 INFO L430 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2142061780, now seen corresponding path program 189 times [2021-06-05 21:50:27,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:27,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726191746] [2021-06-05 21:50:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:27,436 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:27,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726191746] [2021-06-05 21:50:27,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726191746] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:27,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339743872] [2021-06-05 21:50:27,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:27,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:50:27,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:27,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:27,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:27,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:27,579 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:27,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:27,582 INFO L388 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 11 [2021-06-05 21:50:27,582 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:27,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:27,605 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:27,605 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 21:50:27,666 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_918], 1=[array_4, v_prenex_919]} [2021-06-05 21:50:27,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:50:27,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:27,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:50:27,673 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:27,718 INFO L628 ElimStorePlain]: treesize reduction 75, result has 41.9 percent of original size [2021-06-05 21:50:27,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:50:27,721 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:27,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:27,736 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:50:27,738 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:27,739 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:27,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:27,754 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:27,754 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 21:50:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:27,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339743872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:27,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:27,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:27,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223311500] [2021-06-05 21:50:27,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:27,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:27,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:27,823 INFO L87 Difference]: Start difference. First operand 887 states and 3286 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:28,627 INFO L93 Difference]: Finished difference Result 930 states and 3401 transitions. [2021-06-05 21:50:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:50:28,627 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:28,628 INFO L225 Difference]: With dead ends: 930 [2021-06-05 21:50:28,629 INFO L226 Difference]: Without dead ends: 920 [2021-06-05 21:50:28,629 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 911.5ms TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-06-05 21:50:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 884. [2021-06-05 21:50:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.711211778029445) internal successors, (3277), 883 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3277 transitions. [2021-06-05 21:50:28,638 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3277 transitions. Word has length 18 [2021-06-05 21:50:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:28,638 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3277 transitions. [2021-06-05 21:50:28,638 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3277 transitions. [2021-06-05 21:50:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:28,639 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:28,639 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:28,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3860,336 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:28,840 INFO L430 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1603989106, now seen corresponding path program 190 times [2021-06-05 21:50:28,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:28,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866433089] [2021-06-05 21:50:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:29,126 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:29,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866433089] [2021-06-05 21:50:29,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866433089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:29,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951354373] [2021-06-05 21:50:29,126 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:29,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:50:29,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:29,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:50:29,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:29,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,233 INFO L388 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 12 [2021-06-05 21:50:29,233 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,237 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:29,238 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,242 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:29,242 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,246 INFO L388 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 11 [2021-06-05 21:50:29,246 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:29,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:29,311 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:205, output treesize:173 [2021-06-05 21:50:29,639 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 21:50:29,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,644 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:29,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,649 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:29,650 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,653 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:29,654 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,658 INFO L388 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 11 [2021-06-05 21:50:29,659 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,729 INFO L628 ElimStorePlain]: treesize reduction 100, result has 43.5 percent of original size [2021-06-05 21:50:29,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:29,732 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:29,733 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:29,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:29,758 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:29,758 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:207, output treesize:78 [2021-06-05 21:50:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:29,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951354373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:29,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:29,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 21:50:29,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973487262] [2021-06-05 21:50:29,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:50:29,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:29,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:50:29,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:50:29,847 INFO L87 Difference]: Start difference. First operand 884 states and 3277 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:30,133 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-06-05 21:50:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:30,318 INFO L93 Difference]: Finished difference Result 922 states and 3374 transitions. [2021-06-05 21:50:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:30,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:30,320 INFO L225 Difference]: With dead ends: 922 [2021-06-05 21:50:30,320 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 21:50:30,320 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 796.1ms TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 21:50:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 890. [2021-06-05 21:50:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 3.706411698537683) internal successors, (3295), 889 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3295 transitions. [2021-06-05 21:50:30,330 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3295 transitions. Word has length 18 [2021-06-05 21:50:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:30,330 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 3295 transitions. [2021-06-05 21:50:30,330 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3295 transitions. [2021-06-05 21:50:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:30,331 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:30,331 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:30,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3871,337 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:30,532 INFO L430 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:30,532 INFO L82 PathProgramCache]: Analyzing trace with hash 750989444, now seen corresponding path program 191 times [2021-06-05 21:50:30,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:30,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910531145] [2021-06-05 21:50:30,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:30,868 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:30,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910531145] [2021-06-05 21:50:30,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910531145] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:30,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659364560] [2021-06-05 21:50:30,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:30,896 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:30,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:30,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:30,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:30,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:30,988 INFO L388 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 12 [2021-06-05 21:50:30,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:30,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:30,992 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:30,992 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:30,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:30,996 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:30,997 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:30,999 INFO L388 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 11 [2021-06-05 21:50:31,000 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:31,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:31,051 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:31,051 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 21:50:31,181 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_923, array_2], 1=[v_prenex_924, array_4]} [2021-06-05 21:50:31,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:50:31,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:31,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:50:31,189 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:31,232 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.0 percent of original size [2021-06-05 21:50:31,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:50:31,235 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:31,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:31,253 INFO L388 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 [2021-06-05 21:50:31,254 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:31,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:31,270 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:50:31,270 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:31,270 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 21:50:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:31,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659364560] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:31,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:31,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:31,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816769273] [2021-06-05 21:50:31,339 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:31,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:31,339 INFO L87 Difference]: Start difference. First operand 890 states and 3295 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:31,767 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-06-05 21:50:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:32,208 INFO L93 Difference]: Finished difference Result 939 states and 3429 transitions. [2021-06-05 21:50:32,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:50:32,208 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:32,210 INFO L225 Difference]: With dead ends: 939 [2021-06-05 21:50:32,210 INFO L226 Difference]: Without dead ends: 929 [2021-06-05 21:50:32,210 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1077.0ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2021-06-05 21:50:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 883. [2021-06-05 21:50:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.7108843537414966) internal successors, (3273), 882 states have internal predecessors, (3273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3273 transitions. [2021-06-05 21:50:32,219 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3273 transitions. Word has length 18 [2021-06-05 21:50:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:32,219 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3273 transitions. [2021-06-05 21:50:32,219 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3273 transitions. [2021-06-05 21:50:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:32,220 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:32,220 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:32,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 338 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3899 [2021-06-05 21:50:32,421 INFO L430 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1396896124, now seen corresponding path program 192 times [2021-06-05 21:50:32,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:32,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037404295] [2021-06-05 21:50:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:32,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:32,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037404295] [2021-06-05 21:50:32,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037404295] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:32,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253700567] [2021-06-05 21:50:32,761 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:32,797 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:50:32,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:32,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:32,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:32,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:32,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:32,931 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:32,932 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:32,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:32,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:32,936 INFO L388 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 12 [2021-06-05 21:50:32,937 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:32,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:32,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:32,942 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:32,943 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:32,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:32,947 INFO L388 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 11 [2021-06-05 21:50:32,948 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:33,012 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:33,015 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:50:33,015 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:161 [2021-06-05 21:50:33,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:33,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:33,282 INFO L388 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 11 [2021-06-05 21:50:33,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:33,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:33,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:33,288 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:33,289 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:33,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:33,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:33,293 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:33,294 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:33,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:33,298 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:33,299 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:33,360 INFO L628 ElimStorePlain]: treesize reduction 96, result has 44.5 percent of original size [2021-06-05 21:50:33,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:33,364 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:33,364 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:33,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:33,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:33,392 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:207, output treesize:35 [2021-06-05 21:50:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:33,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253700567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:33,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:33,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:50:33,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288410742] [2021-06-05 21:50:33,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:50:33,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:50:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:50:33,459 INFO L87 Difference]: Start difference. First operand 883 states and 3273 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:33,778 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2021-06-05 21:50:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:34,061 INFO L93 Difference]: Finished difference Result 922 states and 3391 transitions. [2021-06-05 21:50:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:34,063 INFO L225 Difference]: With dead ends: 922 [2021-06-05 21:50:34,063 INFO L226 Difference]: Without dead ends: 917 [2021-06-05 21:50:34,063 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 840.5ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:50:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-06-05 21:50:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 881. [2021-06-05 21:50:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7113636363636364) internal successors, (3266), 880 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3266 transitions. [2021-06-05 21:50:34,073 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3266 transitions. Word has length 18 [2021-06-05 21:50:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:34,073 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3266 transitions. [2021-06-05 21:50:34,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3266 transitions. [2021-06-05 21:50:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:34,074 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:34,074 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:34,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 339 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3914 [2021-06-05 21:50:34,274 INFO L430 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:34,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:34,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2046888246, now seen corresponding path program 193 times [2021-06-05 21:50:34,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:34,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146398565] [2021-06-05 21:50:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:34,648 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 21:50:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:35,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:35,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146398565] [2021-06-05 21:50:35,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146398565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:35,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439776860] [2021-06-05 21:50:35,087 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:35,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:50:35,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:35,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:35,230 INFO L388 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 12 [2021-06-05 21:50:35,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:35,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:35,234 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:35,235 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:35,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:35,238 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:35,239 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:35,242 INFO L388 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 11 [2021-06-05 21:50:35,243 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:35,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:35,293 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:35,293 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 21:50:35,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:35,486 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:35,487 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:35,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:35,490 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:35,491 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:35,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:35,494 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:35,494 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:35,497 INFO L388 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 11 [2021-06-05 21:50:35,497 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:35,539 INFO L628 ElimStorePlain]: treesize reduction 67, result has 40.7 percent of original size [2021-06-05 21:50:35,541 INFO L388 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 [2021-06-05 21:50:35,543 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:35,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:35,560 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:35,560 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 21:50:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:35,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439776860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:35,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:35,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 21:50:35,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751331405] [2021-06-05 21:50:35,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 21:50:35,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 21:50:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:50:35,635 INFO L87 Difference]: Start difference. First operand 881 states and 3266 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:36,175 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 21:50:36,479 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2021-06-05 21:50:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:36,620 INFO L93 Difference]: Finished difference Result 935 states and 3409 transitions. [2021-06-05 21:50:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:50:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:36,622 INFO L225 Difference]: With dead ends: 935 [2021-06-05 21:50:36,622 INFO L226 Difference]: Without dead ends: 917 [2021-06-05 21:50:36,622 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1642.4ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:50:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-06-05 21:50:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 882. [2021-06-05 21:50:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 3.7116912599318956) internal successors, (3270), 881 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 3270 transitions. [2021-06-05 21:50:36,632 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 3270 transitions. Word has length 18 [2021-06-05 21:50:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:36,632 INFO L482 AbstractCegarLoop]: Abstraction has 882 states and 3270 transitions. [2021-06-05 21:50:36,632 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 3270 transitions. [2021-06-05 21:50:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:36,633 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:36,633 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:36,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 340 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3940 [2021-06-05 21:50:36,833 INFO L430 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1569373752, now seen corresponding path program 194 times [2021-06-05 21:50:36,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:36,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523240874] [2021-06-05 21:50:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:37,331 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2021-06-05 21:50:37,450 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-06-05 21:50:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:37,735 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:37,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523240874] [2021-06-05 21:50:37,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523240874] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:37,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418167804] [2021-06-05 21:50:37,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:37,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:37,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:37,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:50:37,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:37,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:37,883 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:37,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:37,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:37,887 INFO L388 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 11 [2021-06-05 21:50:37,888 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:37,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:37,891 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:37,892 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:37,894 INFO L388 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 12 [2021-06-05 21:50:37,895 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:37,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:37,946 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:37,946 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 21:50:38,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:38,096 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:38,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:38,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:38,100 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:38,101 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:38,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:38,104 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:38,104 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:38,107 INFO L388 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 11 [2021-06-05 21:50:38,108 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:38,167 INFO L628 ElimStorePlain]: treesize reduction 83, result has 41.1 percent of original size [2021-06-05 21:50:38,170 INFO L388 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 [2021-06-05 21:50:38,171 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:38,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:38,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:38,214 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 21:50:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:38,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418167804] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:38,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:38,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 21:50:38,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265714553] [2021-06-05 21:50:38,342 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 21:50:38,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:38,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 21:50:38,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:50:38,342 INFO L87 Difference]: Start difference. First operand 882 states and 3270 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:38,615 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2021-06-05 21:50:38,909 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2021-06-05 21:50:39,118 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 21:50:39,350 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2021-06-05 21:50:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:39,586 INFO L93 Difference]: Finished difference Result 928 states and 3397 transitions. [2021-06-05 21:50:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:50:39,586 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:39,588 INFO L225 Difference]: With dead ends: 928 [2021-06-05 21:50:39,588 INFO L226 Difference]: Without dead ends: 916 [2021-06-05 21:50:39,588 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1971.9ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:50:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-06-05 21:50:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 884. [2021-06-05 21:50:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.712344280860702) internal successors, (3278), 883 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3278 transitions. [2021-06-05 21:50:39,598 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3278 transitions. Word has length 18 [2021-06-05 21:50:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:39,598 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3278 transitions. [2021-06-05 21:50:39,598 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3278 transitions. [2021-06-05 21:50:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:39,599 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:39,599 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:39,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 341 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3954 [2021-06-05 21:50:39,799 INFO L430 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:39,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash 550929662, now seen corresponding path program 195 times [2021-06-05 21:50:39,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:39,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243651159] [2021-06-05 21:50:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:40,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:40,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243651159] [2021-06-05 21:50:40,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243651159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:40,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686850991] [2021-06-05 21:50:40,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:40,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:50:40,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:40,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:40,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:40,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:40,292 INFO L388 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 11 [2021-06-05 21:50:40,292 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:40,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:40,295 INFO L388 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 12 [2021-06-05 21:50:40,296 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:40,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:40,299 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:40,300 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:40,302 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:40,303 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:40,340 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:40,341 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:40,341 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 21:50:40,507 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_935, array_0], 1=[v_prenex_936, array_4]} [2021-06-05 21:50:40,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:50:40,511 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:40,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:50:40,514 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:40,559 INFO L628 ElimStorePlain]: treesize reduction 83, result has 39.4 percent of original size [2021-06-05 21:50:40,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:50:40,562 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:40,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:40,578 INFO L518 ElimStorePlain]: Eliminatee v_prenex_936 vanished before elimination [2021-06-05 21:50:40,580 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:40,580 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:40,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:40,596 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:40,596 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 21:50:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:40,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686850991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:40,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:40,667 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:40,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675851487] [2021-06-05 21:50:40,667 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:40,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:40,667 INFO L87 Difference]: Start difference. First operand 884 states and 3278 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:41,087 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-06-05 21:50:41,425 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-06-05 21:50:41,645 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2021-06-05 21:50:41,853 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-06-05 21:50:42,031 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2021-06-05 21:50:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:42,107 INFO L93 Difference]: Finished difference Result 1071 states and 3832 transitions. [2021-06-05 21:50:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:50:42,107 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:42,109 INFO L225 Difference]: With dead ends: 1071 [2021-06-05 21:50:42,109 INFO L226 Difference]: Without dead ends: 1061 [2021-06-05 21:50:42,109 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1625.6ms TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2021-06-05 21:50:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 886. [2021-06-05 21:50:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7084745762711866) internal successors, (3282), 885 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3282 transitions. [2021-06-05 21:50:42,119 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3282 transitions. Word has length 18 [2021-06-05 21:50:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:42,119 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3282 transitions. [2021-06-05 21:50:42,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3282 transitions. [2021-06-05 21:50:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:42,120 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:42,120 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:42,321 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3968,342 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:42,321 INFO L430 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:42,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1825878340, now seen corresponding path program 196 times [2021-06-05 21:50:42,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:42,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039550822] [2021-06-05 21:50:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:42,741 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-06-05 21:50:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:43,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:43,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039550822] [2021-06-05 21:50:43,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039550822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:43,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871053912] [2021-06-05 21:50:43,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:43,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:50:43,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:43,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:43,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:43,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:43,131 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:43,131 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:43,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:43,134 INFO L388 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 11 [2021-06-05 21:50:43,135 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:43,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:43,137 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:43,138 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:43,140 INFO L388 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 12 [2021-06-05 21:50:43,141 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:43,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:43,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:43,168 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 21:50:43,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:43,322 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:43,323 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:43,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:43,326 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:43,327 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:43,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:43,329 INFO L388 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 11 [2021-06-05 21:50:43,330 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:43,332 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:43,333 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:43,373 INFO L628 ElimStorePlain]: treesize reduction 70, result has 38.1 percent of original size [2021-06-05 21:50:43,375 INFO L388 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 [2021-06-05 21:50:43,376 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:43,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:43,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:43,392 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:50:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:43,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871053912] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:43,466 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:43,466 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:50:43,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537384075] [2021-06-05 21:50:43,466 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:50:43,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:50:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:50:43,467 INFO L87 Difference]: Start difference. First operand 886 states and 3282 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:43,930 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-06-05 21:50:44,183 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2021-06-05 21:50:44,597 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2021-06-05 21:50:44,981 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2021-06-05 21:50:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:45,190 INFO L93 Difference]: Finished difference Result 996 states and 3571 transitions. [2021-06-05 21:50:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 21:50:45,190 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:45,192 INFO L225 Difference]: With dead ends: 996 [2021-06-05 21:50:45,192 INFO L226 Difference]: Without dead ends: 987 [2021-06-05 21:50:45,192 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1963.9ms TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2021-06-05 21:50:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-06-05 21:50:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 885. [2021-06-05 21:50:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 3.7104072398190047) internal successors, (3280), 884 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3280 transitions. [2021-06-05 21:50:45,202 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3280 transitions. Word has length 18 [2021-06-05 21:50:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:45,202 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 3280 transitions. [2021-06-05 21:50:45,202 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3280 transitions. [2021-06-05 21:50:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:45,203 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:45,203 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:45,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3983,343 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:45,403 INFO L430 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:45,403 INFO L82 PathProgramCache]: Analyzing trace with hash -543054878, now seen corresponding path program 197 times [2021-06-05 21:50:45,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:45,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962405502] [2021-06-05 21:50:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:45,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:45,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962405502] [2021-06-05 21:50:45,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962405502] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:45,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588192591] [2021-06-05 21:50:45,715 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:45,744 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:50:45,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:45,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:45,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:45,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:45,841 INFO L388 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 12 [2021-06-05 21:50:45,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:45,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:45,845 INFO L388 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 11 [2021-06-05 21:50:45,846 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:45,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:45,849 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:45,850 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:45,853 INFO L388 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 26 treesize of output 20 [2021-06-05 21:50:45,853 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:45,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:45,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:50:45,893 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 21:50:46,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:46,018 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:46,018 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:46,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:46,021 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:46,022 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:46,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:46,025 INFO L388 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 11 [2021-06-05 21:50:46,026 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:46,028 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:46,029 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:46,068 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 21:50:46,070 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:46,071 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:46,086 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:46,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:46,087 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:50:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:46,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588192591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:46,155 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:46,155 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:46,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335295005] [2021-06-05 21:50:46,155 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:46,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:46,156 INFO L87 Difference]: Start difference. First operand 885 states and 3280 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:46,743 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 21:50:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:47,122 INFO L93 Difference]: Finished difference Result 936 states and 3421 transitions. [2021-06-05 21:50:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:50:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:47,124 INFO L225 Difference]: With dead ends: 936 [2021-06-05 21:50:47,124 INFO L226 Difference]: Without dead ends: 931 [2021-06-05 21:50:47,124 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1063.5ms TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-06-05 21:50:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 883. [2021-06-05 21:50:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 21:50:47,133 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 21:50:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:47,133 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 21:50:47,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 21:50:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:47,134 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:47,134 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:47,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3997,344 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:47,335 INFO L430 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:47,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:47,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1647567582, now seen corresponding path program 198 times [2021-06-05 21:50:47,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:47,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310342323] [2021-06-05 21:50:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:50:47,382 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:47,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310342323] [2021-06-05 21:50:47,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310342323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:47,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023911769] [2021-06-05 21:50:47,383 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:47,411 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:50:47,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:47,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 21:50:47,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:47,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:50:47,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:47,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:50:47,440 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:47,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:47,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:50:47,455 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:47,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:47,468 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:47,468 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 21:50:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:50:47,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023911769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:47,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:47,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 21:50:47,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641037808] [2021-06-05 21:50:47,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:50:47,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:50:47,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:50:47,548 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:48,135 INFO L93 Difference]: Finished difference Result 1362 states and 4657 transitions. [2021-06-05 21:50:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:50:48,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:48,137 INFO L225 Difference]: With dead ends: 1362 [2021-06-05 21:50:48,137 INFO L226 Difference]: Without dead ends: 1265 [2021-06-05 21:50:48,137 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 531.4ms TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:50:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-06-05 21:50:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 950. [2021-06-05 21:50:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 21:50:48,149 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 21:50:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:48,149 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 21:50:48,150 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 21:50:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:48,151 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:48,151 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:48,351 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 345 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4012 [2021-06-05 21:50:48,351 INFO L430 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2349128, now seen corresponding path program 199 times [2021-06-05 21:50:48,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:48,352 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178216303] [2021-06-05 21:50:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:48,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:48,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178216303] [2021-06-05 21:50:48,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178216303] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:48,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832906740] [2021-06-05 21:50:48,651 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:48,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:50:48,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:48,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:48,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:48,769 INFO L388 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 11 [2021-06-05 21:50:48,770 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:48,772 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:48,772 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:48,773 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:48,796 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:48,797 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:48,797 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:59 [2021-06-05 21:50:49,001 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 21:50:49,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:49,007 INFO L388 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 11 [2021-06-05 21:50:49,008 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:49,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:49,013 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:49,014 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:49,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:49,019 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:49,020 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:49,024 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:49,025 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:49,089 INFO L628 ElimStorePlain]: treesize reduction 85, result has 40.6 percent of original size [2021-06-05 21:50:49,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:49,091 INFO L388 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 [2021-06-05 21:50:49,093 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:49,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:49,115 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:49,115 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:181, output treesize:38 [2021-06-05 21:50:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:49,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832906740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:49,181 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:49,181 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 21:50:49,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582205075] [2021-06-05 21:50:49,181 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:50:49,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:50:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:50:49,181 INFO L87 Difference]: Start difference. First operand 950 states and 3590 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:49,948 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2021-06-05 21:50:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:49,992 INFO L93 Difference]: Finished difference Result 1072 states and 3951 transitions. [2021-06-05 21:50:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:50:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:49,994 INFO L225 Difference]: With dead ends: 1072 [2021-06-05 21:50:49,994 INFO L226 Difference]: Without dead ends: 1053 [2021-06-05 21:50:49,994 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 900.6ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:50:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-06-05 21:50:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 955. [2021-06-05 21:50:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 3.7788259958071277) internal successors, (3605), 954 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 3605 transitions. [2021-06-05 21:50:50,006 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 3605 transitions. Word has length 18 [2021-06-05 21:50:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:50,006 INFO L482 AbstractCegarLoop]: Abstraction has 955 states and 3605 transitions. [2021-06-05 21:50:50,006 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 3605 transitions. [2021-06-05 21:50:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:50,007 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:50,007 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:50,207 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 346 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4020 [2021-06-05 21:50:50,208 INFO L430 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:50,208 INFO L82 PathProgramCache]: Analyzing trace with hash 858845074, now seen corresponding path program 200 times [2021-06-05 21:50:50,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:50,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029237007] [2021-06-05 21:50:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:50,487 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:50,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029237007] [2021-06-05 21:50:50,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029237007] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:50,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8054024] [2021-06-05 21:50:50,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:50,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:50,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:50,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:50,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:50,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:50,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:50,604 INFO L388 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 11 [2021-06-05 21:50:50,605 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:50,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:50,608 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:50,609 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:50,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:50,640 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:50,640 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:55 [2021-06-05 21:50:50,833 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_942], 1=[v_prenex_943, array_4]} [2021-06-05 21:50:50,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:50:50,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:50,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:50:50,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:50,875 INFO L628 ElimStorePlain]: treesize reduction 63, result has 42.7 percent of original size [2021-06-05 21:50:50,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:50:50,878 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:50,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:50,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_943 vanished before elimination [2021-06-05 21:50:50,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:50,892 INFO L388 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 [2021-06-05 21:50:50,893 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:50,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:50,905 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:50,905 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 21:50:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:50,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8054024] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:50,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:50,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 21:50:50,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227642727] [2021-06-05 21:50:50,934 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:50,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:50,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:50,935 INFO L87 Difference]: Start difference. First operand 955 states and 3605 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:51,582 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2021-06-05 21:50:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:51,985 INFO L93 Difference]: Finished difference Result 1084 states and 3991 transitions. [2021-06-05 21:50:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:50:51,985 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:51,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:51,987 INFO L225 Difference]: With dead ends: 1084 [2021-06-05 21:50:51,987 INFO L226 Difference]: Without dead ends: 1074 [2021-06-05 21:50:51,987 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1050.7ms TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2021-06-05 21:50:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 950. [2021-06-05 21:50:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 21:50:51,998 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 21:50:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:51,998 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 21:50:51,998 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 21:50:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:51,999 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:51,999 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:52,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 347 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4032 [2021-06-05 21:50:52,200 INFO L430 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1946717226, now seen corresponding path program 201 times [2021-06-05 21:50:52,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:52,200 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362411906] [2021-06-05 21:50:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:52,424 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:52,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362411906] [2021-06-05 21:50:52,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362411906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:52,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786167282] [2021-06-05 21:50:52,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:52,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:50:52,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:52,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:52,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:52,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:52,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:52,559 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:52,560 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:52,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:52,563 INFO L388 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 11 [2021-06-05 21:50:52,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:52,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:52,591 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:52,591 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:86, output treesize:72 [2021-06-05 21:50:52,734 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_946, array_2], 1=[v_prenex_947, array_4]} [2021-06-05 21:50:52,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:50:52,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:52,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:50:52,750 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:52,784 INFO L628 ElimStorePlain]: treesize reduction 61, result has 42.5 percent of original size [2021-06-05 21:50:52,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:50:52,787 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:52,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:52,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:52,800 INFO L388 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 [2021-06-05 21:50:52,802 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:52,812 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:52,812 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:50:52,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:52,813 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:16 [2021-06-05 21:50:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:52,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786167282] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:52,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:52,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:50:52,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560724252] [2021-06-05 21:50:52,839 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:50:52,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:52,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:50:52,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:50:52,840 INFO L87 Difference]: Start difference. First operand 950 states and 3590 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:53,245 INFO L93 Difference]: Finished difference Result 1011 states and 3762 transitions. [2021-06-05 21:50:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:53,247 INFO L225 Difference]: With dead ends: 1011 [2021-06-05 21:50:53,247 INFO L226 Difference]: Without dead ends: 1006 [2021-06-05 21:50:53,247 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 524.6ms TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:50:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-06-05 21:50:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 956. [2021-06-05 21:50:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 3.781151832460733) internal successors, (3611), 955 states have internal predecessors, (3611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 3611 transitions. [2021-06-05 21:50:53,257 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 3611 transitions. Word has length 18 [2021-06-05 21:50:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:53,257 INFO L482 AbstractCegarLoop]: Abstraction has 956 states and 3611 transitions. [2021-06-05 21:50:53,257 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 3611 transitions. [2021-06-05 21:50:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:53,258 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:53,258 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:53,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4047,348 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:53,458 INFO L430 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:53,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash 408261324, now seen corresponding path program 202 times [2021-06-05 21:50:53,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:53,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679448353] [2021-06-05 21:50:53,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:53,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:53,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679448353] [2021-06-05 21:50:53,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679448353] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:53,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176520715] [2021-06-05 21:50:53,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:53,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:50:53,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:53,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:50:53,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:53,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:53,845 INFO L388 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 11 [2021-06-05 21:50:53,845 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:53,848 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:53,849 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:53,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:53,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:53,876 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 21:50:53,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:53,945 INFO L388 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 11 [2021-06-05 21:50:53,946 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:53,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:53,949 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:53,950 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:53,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:53,953 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:53,954 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:53,956 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:53,957 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:54,017 INFO L628 ElimStorePlain]: treesize reduction 79, result has 42.3 percent of original size [2021-06-05 21:50:54,019 INFO L388 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 [2021-06-05 21:50:54,020 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:54,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:54,046 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:54,047 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 21:50:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:54,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176520715] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:54,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:54,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 21:50:54,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889807543] [2021-06-05 21:50:54,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:50:54,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:50:54,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:50:54,158 INFO L87 Difference]: Start difference. First operand 956 states and 3611 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:54,673 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-06-05 21:50:54,844 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2021-06-05 21:50:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:55,034 INFO L93 Difference]: Finished difference Result 1021 states and 3787 transitions. [2021-06-05 21:50:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:55,034 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:55,036 INFO L225 Difference]: With dead ends: 1021 [2021-06-05 21:50:55,036 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 21:50:55,036 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 966.8ms TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 21:50:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 953. [2021-06-05 21:50:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 3.7804621848739495) internal successors, (3599), 952 states have internal predecessors, (3599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 3599 transitions. [2021-06-05 21:50:55,046 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 3599 transitions. Word has length 18 [2021-06-05 21:50:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:55,046 INFO L482 AbstractCegarLoop]: Abstraction has 953 states and 3599 transitions. [2021-06-05 21:50:55,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 3599 transitions. [2021-06-05 21:50:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:55,047 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:55,047 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:55,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4061,349 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:55,248 INFO L430 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash -465479356, now seen corresponding path program 203 times [2021-06-05 21:50:55,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:55,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084923571] [2021-06-05 21:50:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:55,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:55,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084923571] [2021-06-05 21:50:55,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084923571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:55,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981391704] [2021-06-05 21:50:55,517 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:55,546 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:50:55,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:55,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:55,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:55,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:50:55,657 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:55,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:50:55,669 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:55,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:55,686 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:55,686 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 21:50:55,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:55,738 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:55,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:55,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:55,742 INFO L388 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 35 treesize of output 27 [2021-06-05 21:50:55,743 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:55,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:55,746 INFO L388 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 11 [2021-06-05 21:50:55,746 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:55,749 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:55,749 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:55,789 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 21:50:55,791 INFO L388 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 22 treesize of output 14 [2021-06-05 21:50:55,792 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:55,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:55,808 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:55,808 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:50:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:55,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981391704] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:55,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:55,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:50:55,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005631042] [2021-06-05 21:50:55,872 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:50:55,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:55,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:50:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:50:55,872 INFO L87 Difference]: Start difference. First operand 953 states and 3599 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:56,451 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2021-06-05 21:50:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:56,746 INFO L93 Difference]: Finished difference Result 1019 states and 3793 transitions. [2021-06-05 21:50:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:50:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:56,748 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 21:50:56,748 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 21:50:56,748 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 889.6ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:50:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 21:50:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 950. [2021-06-05 21:50:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 21:50:56,762 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 21:50:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:56,762 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 21:50:56,762 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 21:50:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:56,764 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:56,764 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:56,976 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 350 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4072 [2021-06-05 21:50:56,977 INFO L430 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash -786313054, now seen corresponding path program 204 times [2021-06-05 21:50:56,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:56,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595406133] [2021-06-05 21:50:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:50:57,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:57,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595406133] [2021-06-05 21:50:57,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595406133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:57,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679532919] [2021-06-05 21:50:57,038 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:57,066 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:50:57,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:57,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 21:50:57,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:57,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:50:57,093 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:57,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:50:57,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:57,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:57,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:50:57,112 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:57,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:57,125 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:57,125 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 21:50:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:50:57,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679532919] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:57,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:57,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 21:50:57,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921855713] [2021-06-05 21:50:57,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:50:57,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:57,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:50:57,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:50:57,218 INFO L87 Difference]: Start difference. First operand 950 states and 3590 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:57,914 INFO L93 Difference]: Finished difference Result 1682 states and 5831 transitions. [2021-06-05 21:50:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 21:50:57,914 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:57,917 INFO L225 Difference]: With dead ends: 1682 [2021-06-05 21:50:57,917 INFO L226 Difference]: Without dead ends: 1571 [2021-06-05 21:50:57,917 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 613.5ms TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:50:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2021-06-05 21:50:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 932. [2021-06-05 21:50:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 21:50:57,932 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 21:50:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:57,932 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 21:50:57,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 21:50:57,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:57,933 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:57,933 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:58,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4082,351 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:58,134 INFO L430 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash 436630378, now seen corresponding path program 205 times [2021-06-05 21:50:58,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:58,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150136597] [2021-06-05 21:50:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:58,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:58,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150136597] [2021-06-05 21:50:58,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150136597] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:58,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407111559] [2021-06-05 21:50:58,324 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:58,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:50:58,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:58,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,499 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:58,500 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:58,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,503 INFO L388 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 11 [2021-06-05 21:50:58,504 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:58,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:58,545 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:50:58,545 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:90 [2021-06-05 21:50:58,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,729 INFO L388 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 11 [2021-06-05 21:50:58,730 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:58,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,738 INFO L388 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 17 treesize of output 13 [2021-06-05 21:50:58,739 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:58,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,746 INFO L388 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 27 treesize of output 21 [2021-06-05 21:50:58,747 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:58,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,752 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:58,753 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:58,830 INFO L628 ElimStorePlain]: treesize reduction 99, result has 42.8 percent of original size [2021-06-05 21:50:58,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:58,833 INFO L388 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 [2021-06-05 21:50:58,835 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:50:58,862 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:58,864 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:50:58,864 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:205, output treesize:44 [2021-06-05 21:50:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:58,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407111559] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:58,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:50:58,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 21:50:58,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023363486] [2021-06-05 21:50:58,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:50:58,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:50:58,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:50:58,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:50:58,933 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:50:59,270 INFO L93 Difference]: Finished difference Result 979 states and 3632 transitions. [2021-06-05 21:50:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:50:59,271 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:50:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:50:59,272 INFO L225 Difference]: With dead ends: 979 [2021-06-05 21:50:59,272 INFO L226 Difference]: Without dead ends: 966 [2021-06-05 21:50:59,273 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 489.0ms TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:50:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-06-05 21:50:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 938. [2021-06-05 21:50:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7630736392742796) internal successors, (3526), 937 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3526 transitions. [2021-06-05 21:50:59,282 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3526 transitions. Word has length 18 [2021-06-05 21:50:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:50:59,282 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3526 transitions. [2021-06-05 21:50:59,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:50:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3526 transitions. [2021-06-05 21:50:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:50:59,283 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:50:59,284 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:50:59,484 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4091,352 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:59,484 INFO L430 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:50:59,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:50:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1503358368, now seen corresponding path program 206 times [2021-06-05 21:50:59,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:50:59,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334158972] [2021-06-05 21:50:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:50:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:50:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:50:59,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:50:59,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334158972] [2021-06-05 21:50:59,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334158972] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:50:59,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85396469] [2021-06-05 21:50:59,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:50:59,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:50:59,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:50:59,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:50:59,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:50:59,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:59,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:59,830 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:59,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:59,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:59,834 INFO L388 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 11 [2021-06-05 21:50:59,834 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:59,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:50:59,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:50:59,872 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:84 [2021-06-05 21:50:59,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:59,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:59,951 INFO L388 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 25 treesize of output 19 [2021-06-05 21:50:59,952 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:50:59,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:50:59,955 INFO L388 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 11 [2021-06-05 21:50:59,956 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:00,028 INFO L628 ElimStorePlain]: treesize reduction 104, result has 41.9 percent of original size [2021-06-05 21:51:00,028 INFO L518 ElimStorePlain]: Eliminatee v_prenex_956 vanished before elimination [2021-06-05 21:51:00,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:00,031 INFO L388 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 19 treesize of output 15 [2021-06-05 21:51:00,032 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:00,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:00,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:00,058 INFO L388 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 [2021-06-05 21:51:00,059 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:00,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:00,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:00,083 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:193, output treesize:76 [2021-06-05 21:51:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:00,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85396469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:00,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:00,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:51:00,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176887430] [2021-06-05 21:51:00,172 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:51:00,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:00,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:51:00,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:51:00,172 INFO L87 Difference]: Start difference. First operand 938 states and 3526 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:00,554 INFO L93 Difference]: Finished difference Result 981 states and 3649 transitions. [2021-06-05 21:51:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:00,556 INFO L225 Difference]: With dead ends: 981 [2021-06-05 21:51:00,556 INFO L226 Difference]: Without dead ends: 976 [2021-06-05 21:51:00,556 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 391.0ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:51:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2021-06-05 21:51:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 935. [2021-06-05 21:51:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 3.7655246252676657) internal successors, (3517), 934 states have internal predecessors, (3517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 3517 transitions. [2021-06-05 21:51:00,567 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 3517 transitions. Word has length 18 [2021-06-05 21:51:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:00,567 INFO L482 AbstractCegarLoop]: Abstraction has 935 states and 3517 transitions. [2021-06-05 21:51:00,567 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 3517 transitions. [2021-06-05 21:51:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:00,568 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:00,568 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:00,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4105,353 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:00,768 INFO L430 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1917868248, now seen corresponding path program 207 times [2021-06-05 21:51:00,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:00,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978326256] [2021-06-05 21:51:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:00,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:00,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978326256] [2021-06-05 21:51:00,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978326256] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:00,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17278836] [2021-06-05 21:51:00,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:01,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:51:01,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:01,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:01,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:01,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:01,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:01,135 INFO L388 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 11 [2021-06-05 21:51:01,135 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:01,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:01,139 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:01,140 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:01,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:01,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:51:01,184 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:89 [2021-06-05 21:51:01,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:01,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:01,323 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:01,324 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:01,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:01,328 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:01,329 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:01,409 INFO L628 ElimStorePlain]: treesize reduction 103, result has 44.9 percent of original size [2021-06-05 21:51:01,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:51:01,413 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:01,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:01,440 INFO L518 ElimStorePlain]: Eliminatee v_prenex_959 vanished before elimination [2021-06-05 21:51:01,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:01,443 INFO L388 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 22 treesize of output 14 [2021-06-05 21:51:01,444 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:01,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:01,471 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:01,471 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:199, output treesize:35 [2021-06-05 21:51:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:01,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17278836] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:01,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:01,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2021-06-05 21:51:01,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129953779] [2021-06-05 21:51:01,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:51:01,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:51:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:51:01,529 INFO L87 Difference]: Start difference. First operand 935 states and 3517 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:02,210 INFO L93 Difference]: Finished difference Result 994 states and 3674 transitions. [2021-06-05 21:51:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:51:02,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:02,212 INFO L225 Difference]: With dead ends: 994 [2021-06-05 21:51:02,212 INFO L226 Difference]: Without dead ends: 989 [2021-06-05 21:51:02,212 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 667.5ms TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:51:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-06-05 21:51:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 938. [2021-06-05 21:51:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7662753468516543) internal successors, (3529), 937 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3529 transitions. [2021-06-05 21:51:02,222 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3529 transitions. Word has length 18 [2021-06-05 21:51:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:02,222 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3529 transitions. [2021-06-05 21:51:02,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3529 transitions. [2021-06-05 21:51:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:02,223 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:02,224 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:02,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4124,354 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:02,424 INFO L430 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 246892232, now seen corresponding path program 208 times [2021-06-05 21:51:02,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:02,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657233660] [2021-06-05 21:51:02,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:02,655 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:02,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657233660] [2021-06-05 21:51:02,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657233660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:02,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912807615] [2021-06-05 21:51:02,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:02,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:51:02,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:02,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:02,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:02,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:02,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:02,821 INFO L388 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 11 [2021-06-05 21:51:02,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:02,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:02,825 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:02,826 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:02,866 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:02,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:51:02,868 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:99 [2021-06-05 21:51:03,004 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 21:51:03,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:03,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:03,009 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:03,009 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:03,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:03,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:03,014 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:03,015 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:03,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:03,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:03,019 INFO L388 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 11 [2021-06-05 21:51:03,020 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:03,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:03,023 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:03,024 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:03,083 INFO L628 ElimStorePlain]: treesize reduction 92, result has 43.6 percent of original size [2021-06-05 21:51:03,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:03,086 INFO L388 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 [2021-06-05 21:51:03,087 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:03,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:03,113 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:03,113 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:199, output treesize:79 [2021-06-05 21:51:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:03,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912807615] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:03,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:03,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 21:51:03,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006774241] [2021-06-05 21:51:03,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:51:03,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:51:03,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:51:03,209 INFO L87 Difference]: Start difference. First operand 938 states and 3529 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:03,513 INFO L93 Difference]: Finished difference Result 977 states and 3628 transitions. [2021-06-05 21:51:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:03,515 INFO L225 Difference]: With dead ends: 977 [2021-06-05 21:51:03,515 INFO L226 Difference]: Without dead ends: 966 [2021-06-05 21:51:03,515 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 528.8ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:51:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-06-05 21:51:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 932. [2021-06-05 21:51:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 21:51:03,525 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 21:51:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:03,525 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 21:51:03,525 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 21:51:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:03,526 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:03,526 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:03,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 355 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4151 [2021-06-05 21:51:03,727 INFO L430 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1828182638, now seen corresponding path program 209 times [2021-06-05 21:51:03,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:03,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575541806] [2021-06-05 21:51:03,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:04,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:04,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575541806] [2021-06-05 21:51:04,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575541806] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:04,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962574951] [2021-06-05 21:51:04,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:04,087 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:51:04,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:04,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:04,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:04,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,177 INFO L388 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 12 [2021-06-05 21:51:04,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,181 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:04,182 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,186 INFO L388 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 11 [2021-06-05 21:51:04,187 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,190 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:04,191 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,255 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:04,257 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:04,257 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:163 [2021-06-05 21:51:04,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,666 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:04,667 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,672 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:04,672 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,678 INFO L388 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 11 [2021-06-05 21:51:04,679 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,685 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:04,686 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,751 INFO L628 ElimStorePlain]: treesize reduction 95, result has 45.7 percent of original size [2021-06-05 21:51:04,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:04,755 INFO L388 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 22 treesize of output 14 [2021-06-05 21:51:04,755 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:04,783 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:04,784 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:04,784 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:205, output treesize:41 [2021-06-05 21:51:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:04,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962574951] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:04,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:04,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-05 21:51:04,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587964955] [2021-06-05 21:51:04,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:51:04,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:04,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:51:04,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:51:04,867 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:05,180 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2021-06-05 21:51:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:05,428 INFO L93 Difference]: Finished difference Result 984 states and 3645 transitions. [2021-06-05 21:51:05,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:05,430 INFO L225 Difference]: With dead ends: 984 [2021-06-05 21:51:05,430 INFO L226 Difference]: Without dead ends: 971 [2021-06-05 21:51:05,430 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 975.0ms TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:51:05,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-06-05 21:51:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 938. [2021-06-05 21:51:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7630736392742796) internal successors, (3526), 937 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3526 transitions. [2021-06-05 21:51:05,440 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3526 transitions. Word has length 18 [2021-06-05 21:51:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:05,440 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3526 transitions. [2021-06-05 21:51:05,440 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3526 transitions. [2021-06-05 21:51:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:05,441 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:05,441 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:05,642 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 356 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4166 [2021-06-05 21:51:05,642 INFO L430 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 526795912, now seen corresponding path program 210 times [2021-06-05 21:51:05,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:05,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463561752] [2021-06-05 21:51:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:05,901 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:05,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463561752] [2021-06-05 21:51:05,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463561752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:05,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250190799] [2021-06-05 21:51:05,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:05,928 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:51:05,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:05,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:05,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:06,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,048 INFO L388 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 11 [2021-06-05 21:51:06,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,053 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:06,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,057 INFO L388 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 12 [2021-06-05 21:51:06,058 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,061 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:06,062 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:06,123 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:51:06,123 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:161 [2021-06-05 21:51:06,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,406 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:06,406 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,411 INFO L388 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 11 [2021-06-05 21:51:06,412 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,416 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:06,417 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,421 INFO L388 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 35 treesize of output 27 [2021-06-05 21:51:06,422 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,484 INFO L628 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2021-06-05 21:51:06,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:06,487 INFO L388 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 22 treesize of output 14 [2021-06-05 21:51:06,488 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:06,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:06,515 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:06,515 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:207, output treesize:35 [2021-06-05 21:51:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:06,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250190799] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:06,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:06,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:51:06,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736675786] [2021-06-05 21:51:06,570 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:51:06,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:51:06,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:51:06,570 INFO L87 Difference]: Start difference. First operand 938 states and 3526 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:06,882 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2021-06-05 21:51:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:07,274 INFO L93 Difference]: Finished difference Result 996 states and 3695 transitions. [2021-06-05 21:51:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:07,276 INFO L225 Difference]: With dead ends: 996 [2021-06-05 21:51:07,276 INFO L226 Difference]: Without dead ends: 991 [2021-06-05 21:51:07,276 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 819.1ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:51:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2021-06-05 21:51:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 932. [2021-06-05 21:51:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 21:51:07,286 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 21:51:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:07,286 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 21:51:07,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 21:51:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:07,287 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:07,287 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:07,487 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4179,357 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:07,488 INFO L430 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1621089656, now seen corresponding path program 211 times [2021-06-05 21:51:07,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:07,488 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352884312] [2021-06-05 21:51:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:07,851 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:07,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352884312] [2021-06-05 21:51:07,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352884312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:07,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321615435] [2021-06-05 21:51:07,851 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:07,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:07,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:07,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:07,973 INFO L388 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 12 [2021-06-05 21:51:07,974 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:07,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:07,977 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:07,978 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:07,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:07,981 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:07,982 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:07,985 INFO L388 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 11 [2021-06-05 21:51:07,985 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:08,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:08,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:08,043 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 21:51:08,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:08,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:08,199 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:08,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:08,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:08,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:08,203 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:08,204 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:08,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:08,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:08,207 INFO L388 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 11 [2021-06-05 21:51:08,208 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:08,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:08,211 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:08,212 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:08,282 INFO L628 ElimStorePlain]: treesize reduction 85, result has 45.2 percent of original size [2021-06-05 21:51:08,285 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:08,285 INFO L388 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 22 treesize of output 14 [2021-06-05 21:51:08,286 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:08,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:08,316 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:08,316 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:185, output treesize:56 [2021-06-05 21:51:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:08,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321615435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:08,465 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:08,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 21:51:08,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712051432] [2021-06-05 21:51:08,465 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:51:08,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:51:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:51:08,465 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:08,925 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2021-06-05 21:51:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:09,173 INFO L93 Difference]: Finished difference Result 988 states and 3667 transitions. [2021-06-05 21:51:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:09,173 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:09,175 INFO L225 Difference]: With dead ends: 988 [2021-06-05 21:51:09,175 INFO L226 Difference]: Without dead ends: 975 [2021-06-05 21:51:09,175 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1002.4ms TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:51:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-06-05 21:51:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 932. [2021-06-05 21:51:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 21:51:09,185 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 21:51:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:09,185 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 21:51:09,185 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 21:51:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:09,186 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:09,186 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:09,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4205,358 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:09,386 INFO L430 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash -584456886, now seen corresponding path program 212 times [2021-06-05 21:51:09,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:09,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555223665] [2021-06-05 21:51:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:51:09,435 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:09,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555223665] [2021-06-05 21:51:09,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555223665] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:09,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091783872] [2021-06-05 21:51:09,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:09,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:51:09,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:09,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:51:09,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:09,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:09,519 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:09,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:09,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:09,522 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:09,523 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:09,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:09,526 INFO L388 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 12 [2021-06-05 21:51:09,527 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:09,529 INFO L388 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 11 [2021-06-05 21:51:09,529 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:09,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:09,556 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:09,556 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:75 [2021-06-05 21:51:09,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:09,666 INFO L388 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 18 treesize of output 14 [2021-06-05 21:51:09,666 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:09,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:09,669 INFO L388 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 11 [2021-06-05 21:51:09,670 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:09,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:09,672 INFO L388 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 12 [2021-06-05 21:51:09,673 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:09,675 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:09,676 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:09,708 INFO L628 ElimStorePlain]: treesize reduction 56, result has 38.5 percent of original size [2021-06-05 21:51:09,710 INFO L388 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 12 treesize of output 8 [2021-06-05 21:51:09,711 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:09,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:09,724 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:09,724 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:115, output treesize:27 [2021-06-05 21:51:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:09,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091783872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:09,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:09,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:51:09,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970990303] [2021-06-05 21:51:09,754 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:51:09,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:51:09,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:51:09,754 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:10,866 INFO L93 Difference]: Finished difference Result 1418 states and 4919 transitions. [2021-06-05 21:51:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 21:51:10,867 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:10,869 INFO L225 Difference]: With dead ends: 1418 [2021-06-05 21:51:10,869 INFO L226 Difference]: Without dead ends: 1269 [2021-06-05 21:51:10,869 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 969.3ms TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2021-06-05 21:51:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2021-06-05 21:51:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 878. [2021-06-05 21:51:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 21:51:10,880 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 21:51:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:10,880 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 21:51:10,880 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 21:51:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:10,881 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:10,881 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:11,082 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 359 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4219 [2021-06-05 21:51:11,082 INFO L430 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1994899952, now seen corresponding path program 213 times [2021-06-05 21:51:11,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:11,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861794815] [2021-06-05 21:51:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:11,601 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:11,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861794815] [2021-06-05 21:51:11,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861794815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:11,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686436217] [2021-06-05 21:51:11,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:11,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:51:11,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:11,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:11,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:11,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:11,793 INFO L388 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 12 [2021-06-05 21:51:11,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:11,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:11,797 INFO L388 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 11 [2021-06-05 21:51:11,798 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:11,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:11,801 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:11,801 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:11,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:11,804 INFO L388 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 12 [2021-06-05 21:51:11,805 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:11,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:11,808 INFO L388 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 11 [2021-06-05 21:51:11,809 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:11,811 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:11,812 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:11,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:11,870 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:51:11,870 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:135 [2021-06-05 21:51:11,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:51:11,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:11,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:51:11,998 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:12,012 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:51:12,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:51:12,014 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:12,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:12,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:12,021 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:51:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:12,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686436217] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:12,053 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:12,053 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:51:12,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910089966] [2021-06-05 21:51:12,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:51:12,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:51:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:51:12,054 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:12,641 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2021-06-05 21:51:12,830 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2021-06-05 21:51:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:13,005 INFO L93 Difference]: Finished difference Result 924 states and 3403 transitions. [2021-06-05 21:51:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:13,005 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:13,006 INFO L225 Difference]: With dead ends: 924 [2021-06-05 21:51:13,007 INFO L226 Difference]: Without dead ends: 919 [2021-06-05 21:51:13,007 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1309.6ms TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:51:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-06-05 21:51:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 878. [2021-06-05 21:51:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 21:51:13,016 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 21:51:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:13,016 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 21:51:13,016 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 21:51:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:13,017 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:13,017 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:13,217 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4230,360 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:13,217 INFO L430 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1178914066, now seen corresponding path program 214 times [2021-06-05 21:51:13,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:13,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129541968] [2021-06-05 21:51:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:13,689 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 21:51:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:13,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:13,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129541968] [2021-06-05 21:51:13,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129541968] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:13,979 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665143583] [2021-06-05 21:51:13,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:14,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:51:14,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:14,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:14,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:14,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:14,147 INFO L388 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 12 [2021-06-05 21:51:14,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:14,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:14,151 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:14,152 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:14,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:14,155 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:14,156 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:14,159 INFO L388 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 11 [2021-06-05 21:51:14,159 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:14,208 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:14,209 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:14,209 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:51:14,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:14,402 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:14,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:14,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:14,406 INFO L388 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 35 treesize of output 27 [2021-06-05 21:51:14,407 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:14,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:14,409 INFO L388 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 11 [2021-06-05 21:51:14,410 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:14,412 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:14,413 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:14,455 INFO L628 ElimStorePlain]: treesize reduction 81, result has 36.2 percent of original size [2021-06-05 21:51:14,457 INFO L388 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 [2021-06-05 21:51:14,458 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:14,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:14,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:14,475 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 21:51:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:14,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665143583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:14,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:14,551 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 21:51:14,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228270200] [2021-06-05 21:51:14,551 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 21:51:14,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 21:51:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:51:14,551 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:15,228 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 21:51:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:15,794 INFO L93 Difference]: Finished difference Result 989 states and 3591 transitions. [2021-06-05 21:51:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:51:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:15,796 INFO L225 Difference]: With dead ends: 989 [2021-06-05 21:51:15,796 INFO L226 Difference]: Without dead ends: 971 [2021-06-05 21:51:15,797 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1661.8ms TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:51:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-06-05 21:51:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 878. [2021-06-05 21:51:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 21:51:15,806 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 21:51:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:15,806 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 21:51:15,806 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 21:51:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:15,807 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:15,808 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:16,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 361 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4244 [2021-06-05 21:51:16,008 INFO L430 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:16,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:16,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1253312526, now seen corresponding path program 215 times [2021-06-05 21:51:16,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:16,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047563201] [2021-06-05 21:51:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:16,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:16,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047563201] [2021-06-05 21:51:16,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047563201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:16,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619421092] [2021-06-05 21:51:16,224 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:16,254 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:51:16,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:16,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:16,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:16,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:16,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:16,414 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:16,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:16,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:16,419 INFO L388 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 11 [2021-06-05 21:51:16,420 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:16,455 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:16,457 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:51:16,457 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:84 [2021-06-05 21:51:16,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:16,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:16,672 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:16,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:16,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:16,676 INFO L388 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 19 treesize of output 15 [2021-06-05 21:51:16,676 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:16,729 INFO L628 ElimStorePlain]: treesize reduction 79, result has 44.0 percent of original size [2021-06-05 21:51:16,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:51:16,732 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:16,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:16,749 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:51:16,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:16,751 INFO L388 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 12 treesize of output 8 [2021-06-05 21:51:16,753 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:16,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:16,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:16,770 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:152, output treesize:16 [2021-06-05 21:51:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:16,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619421092] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:16,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:16,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:51:16,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859968603] [2021-06-05 21:51:16,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:51:16,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:51:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:51:16,787 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:17,158 INFO L93 Difference]: Finished difference Result 910 states and 3365 transitions. [2021-06-05 21:51:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:17,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:17,160 INFO L225 Difference]: With dead ends: 910 [2021-06-05 21:51:17,160 INFO L226 Difference]: Without dead ends: 905 [2021-06-05 21:51:17,160 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 455.1ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:51:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2021-06-05 21:51:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 884. [2021-06-05 21:51:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7440543601359004) internal successors, (3306), 883 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3306 transitions. [2021-06-05 21:51:17,169 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3306 transitions. Word has length 18 [2021-06-05 21:51:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:17,169 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3306 transitions. [2021-06-05 21:51:17,169 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3306 transitions. [2021-06-05 21:51:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:17,171 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:17,171 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:17,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4257,362 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:17,371 INFO L430 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1101666024, now seen corresponding path program 216 times [2021-06-05 21:51:17,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:17,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519886059] [2021-06-05 21:51:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:17,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:17,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519886059] [2021-06-05 21:51:17,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519886059] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:17,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939895728] [2021-06-05 21:51:17,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:17,609 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:51:17,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:17,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:17,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:17,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:17,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:17,740 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:17,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:17,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:17,744 INFO L388 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 11 [2021-06-05 21:51:17,744 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:17,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:17,783 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:51:17,783 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:88 [2021-06-05 21:51:17,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:17,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:17,865 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:17,866 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:17,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:17,869 INFO L388 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 11 [2021-06-05 21:51:17,870 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:17,943 INFO L628 ElimStorePlain]: treesize reduction 104, result has 43.2 percent of original size [2021-06-05 21:51:17,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:17,946 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:17,947 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:17,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:17,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:17,973 INFO L388 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 [2021-06-05 21:51:17,974 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:17,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:17,997 INFO L518 ElimStorePlain]: Eliminatee v_prenex_990 vanished before elimination [2021-06-05 21:51:17,998 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:17,999 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:201, output treesize:76 [2021-06-05 21:51:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:18,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939895728] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:18,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:18,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:51:18,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502812950] [2021-06-05 21:51:18,085 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:51:18,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:18,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:51:18,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:51:18,085 INFO L87 Difference]: Start difference. First operand 884 states and 3306 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:18,346 INFO L93 Difference]: Finished difference Result 920 states and 3397 transitions. [2021-06-05 21:51:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:18,348 INFO L225 Difference]: With dead ends: 920 [2021-06-05 21:51:18,348 INFO L226 Difference]: Without dead ends: 915 [2021-06-05 21:51:18,348 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 427.2ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:51:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-06-05 21:51:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 881. [2021-06-05 21:51:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.743181818181818) internal successors, (3294), 880 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3294 transitions. [2021-06-05 21:51:18,357 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3294 transitions. Word has length 18 [2021-06-05 21:51:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:18,357 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3294 transitions. [2021-06-05 21:51:18,357 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3294 transitions. [2021-06-05 21:51:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:18,358 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:18,358 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:18,559 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4279,363 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:18,559 INFO L430 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash 227925344, now seen corresponding path program 217 times [2021-06-05 21:51:18,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:18,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721567143] [2021-06-05 21:51:18,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:18,809 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:18,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721567143] [2021-06-05 21:51:18,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721567143] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:18,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786765993] [2021-06-05 21:51:18,809 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:18,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:51:18,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:18,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:51:18,952 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:18,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:51:18,955 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:18,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:18,971 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:18,971 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 21:51:19,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:19,022 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:19,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:19,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:19,026 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:19,026 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:19,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:19,029 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:19,030 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:19,032 INFO L388 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 11 [2021-06-05 21:51:19,033 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:19,071 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 21:51:19,073 INFO L388 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 [2021-06-05 21:51:19,074 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:19,089 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:19,090 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:19,090 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:51:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:19,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786765993] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:19,152 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:19,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:51:19,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73178151] [2021-06-05 21:51:19,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:51:19,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:19,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:51:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:51:19,153 INFO L87 Difference]: Start difference. First operand 881 states and 3294 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:19,840 INFO L93 Difference]: Finished difference Result 915 states and 3387 transitions. [2021-06-05 21:51:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:19,841 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:19,842 INFO L225 Difference]: With dead ends: 915 [2021-06-05 21:51:19,842 INFO L226 Difference]: Without dead ends: 910 [2021-06-05 21:51:19,842 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 750.6ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:51:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-06-05 21:51:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 878. [2021-06-05 21:51:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 21:51:19,851 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 21:51:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:19,852 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 21:51:19,852 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 21:51:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:19,853 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:19,853 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:20,053 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 364 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4299 [2021-06-05 21:51:20,053 INFO L430 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash 776841754, now seen corresponding path program 218 times [2021-06-05 21:51:20,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:20,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390430064] [2021-06-05 21:51:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:20,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:20,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390430064] [2021-06-05 21:51:20,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390430064] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:20,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233748471] [2021-06-05 21:51:20,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:20,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:51:20,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:20,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:20,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:20,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:20,485 INFO L388 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 12 [2021-06-05 21:51:20,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:20,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:20,489 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:20,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:20,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:20,493 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:20,494 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:20,497 INFO L388 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 11 [2021-06-05 21:51:20,497 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:20,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:20,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:20,555 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:51:20,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:51:20,717 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:20,723 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:20,723 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:51:20,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:20,723 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:51:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:20,752 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233748471] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:20,752 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:20,752 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:51:20,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432108561] [2021-06-05 21:51:20,752 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:51:20,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:51:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:51:20,752 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:21,244 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 21:51:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:21,620 INFO L93 Difference]: Finished difference Result 915 states and 3378 transitions. [2021-06-05 21:51:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:21,620 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:21,621 INFO L225 Difference]: With dead ends: 915 [2021-06-05 21:51:21,621 INFO L226 Difference]: Without dead ends: 910 [2021-06-05 21:51:21,622 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1051.4ms TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:51:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-06-05 21:51:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 884. [2021-06-05 21:51:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7474518686296716) internal successors, (3309), 883 states have internal predecessors, (3309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3309 transitions. [2021-06-05 21:51:21,631 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3309 transitions. Word has length 18 [2021-06-05 21:51:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:21,631 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3309 transitions. [2021-06-05 21:51:21,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3309 transitions. [2021-06-05 21:51:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:21,632 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:21,632 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:21,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4309,365 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:21,832 INFO L430 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1163146992, now seen corresponding path program 219 times [2021-06-05 21:51:21,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:21,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803298916] [2021-06-05 21:51:21,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:22,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:22,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803298916] [2021-06-05 21:51:22,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803298916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:22,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292690186] [2021-06-05 21:51:22,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:22,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:51:22,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:22,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:22,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:22,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,288 INFO L388 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 12 [2021-06-05 21:51:22,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:22,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,303 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:22,304 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:22,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,308 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:22,309 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:22,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,312 INFO L388 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 11 [2021-06-05 21:51:22,312 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:22,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:22,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:51:22,367 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:167, output treesize:131 [2021-06-05 21:51:22,536 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 21:51:22,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,540 INFO L388 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 11 [2021-06-05 21:51:22,541 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:22,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,553 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:22,554 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:22,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,557 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:22,558 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:22,561 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:22,562 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:22,611 INFO L628 ElimStorePlain]: treesize reduction 82, result has 40.1 percent of original size [2021-06-05 21:51:22,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:22,613 INFO L388 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 [2021-06-05 21:51:22,615 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:22,635 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:22,636 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:22,636 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 21:51:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:22,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292690186] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:22,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:22,704 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:51:22,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855362051] [2021-06-05 21:51:22,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:51:22,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:51:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:51:22,705 INFO L87 Difference]: Start difference. First operand 884 states and 3309 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:23,130 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 21:51:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:23,419 INFO L93 Difference]: Finished difference Result 931 states and 3434 transitions. [2021-06-05 21:51:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:23,421 INFO L225 Difference]: With dead ends: 931 [2021-06-05 21:51:23,421 INFO L226 Difference]: Without dead ends: 926 [2021-06-05 21:51:23,421 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 879.0ms TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:51:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-06-05 21:51:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 878. [2021-06-05 21:51:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 21:51:23,430 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 21:51:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:23,430 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 21:51:23,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 21:51:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:23,432 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:23,432 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:23,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4323,366 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:23,632 INFO L430 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 983934736, now seen corresponding path program 220 times [2021-06-05 21:51:23,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:23,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919564839] [2021-06-05 21:51:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:23,914 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:23,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919564839] [2021-06-05 21:51:23,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919564839] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:23,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721359785] [2021-06-05 21:51:23,914 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:23,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:51:23,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:23,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:23,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:24,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,023 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:24,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:24,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,028 INFO L388 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 12 [2021-06-05 21:51:24,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:24,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,033 INFO L388 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 11 [2021-06-05 21:51:24,033 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:24,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,037 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:24,038 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:24,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:24,106 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:24,106 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:217, output treesize:181 [2021-06-05 21:51:24,371 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 21:51:24,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,376 INFO L388 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 11 [2021-06-05 21:51:24,376 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:24,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,381 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:24,382 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:24,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,386 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:24,387 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:24,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,391 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:24,391 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:24,482 INFO L628 ElimStorePlain]: treesize reduction 106, result has 43.9 percent of original size [2021-06-05 21:51:24,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:24,486 INFO L388 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 [2021-06-05 21:51:24,487 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:24,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:24,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:24,522 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:223, output treesize:90 [2021-06-05 21:51:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:24,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721359785] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:24,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:24,705 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 21:51:24,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624887734] [2021-06-05 21:51:24,705 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:51:24,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:51:24,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:51:24,705 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:24,965 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-06-05 21:51:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:25,154 INFO L93 Difference]: Finished difference Result 919 states and 3396 transitions. [2021-06-05 21:51:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:25,155 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:25,156 INFO L225 Difference]: With dead ends: 919 [2021-06-05 21:51:25,156 INFO L226 Difference]: Without dead ends: 906 [2021-06-05 21:51:25,156 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 887.1ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:51:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-06-05 21:51:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 880. [2021-06-05 21:51:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7474402730375425) internal successors, (3294), 879 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3294 transitions. [2021-06-05 21:51:25,166 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3294 transitions. Word has length 18 [2021-06-05 21:51:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:25,166 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3294 transitions. [2021-06-05 21:51:25,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3294 transitions. [2021-06-05 21:51:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:25,168 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:25,168 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:25,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4349,367 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:25,368 INFO L430 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:25,368 INFO L82 PathProgramCache]: Analyzing trace with hash 333942614, now seen corresponding path program 221 times [2021-06-05 21:51:25,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:25,368 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076345864] [2021-06-05 21:51:25,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:25,816 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 21:51:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:26,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:26,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076345864] [2021-06-05 21:51:26,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076345864] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:26,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681411235] [2021-06-05 21:51:26,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:26,274 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:51:26,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:26,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:26,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:26,396 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:26,397 INFO L388 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 12 [2021-06-05 21:51:26,397 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:26,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:26,401 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:26,402 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:26,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:26,405 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:26,406 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:26,408 INFO L388 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 11 [2021-06-05 21:51:26,409 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:26,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:26,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:26,459 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:51:26,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:51:26,641 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:26,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:26,647 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:51:26,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:26,648 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:51:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:26,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681411235] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:26,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:26,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:51:26,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972867059] [2021-06-05 21:51:26,690 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:51:26,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:51:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:51:26,691 INFO L87 Difference]: Start difference. First operand 880 states and 3294 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:27,302 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 21:51:27,563 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2021-06-05 21:51:27,873 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2021-06-05 21:51:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:27,962 INFO L93 Difference]: Finished difference Result 916 states and 3382 transitions. [2021-06-05 21:51:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:27,963 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:27,964 INFO L225 Difference]: With dead ends: 916 [2021-06-05 21:51:27,964 INFO L226 Difference]: Without dead ends: 911 [2021-06-05 21:51:27,964 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1970.6ms TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:51:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2021-06-05 21:51:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 884. [2021-06-05 21:51:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7497168742921856) internal successors, (3311), 883 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3311 transitions. [2021-06-05 21:51:27,974 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3311 transitions. Word has length 18 [2021-06-05 21:51:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:27,974 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3311 transitions. [2021-06-05 21:51:27,974 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3311 transitions. [2021-06-05 21:51:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:27,975 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:27,975 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:28,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 368 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4371 [2021-06-05 21:51:28,176 INFO L430 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1606046132, now seen corresponding path program 222 times [2021-06-05 21:51:28,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:28,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461142873] [2021-06-05 21:51:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:28,653 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:28,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461142873] [2021-06-05 21:51:28,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461142873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:28,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160356195] [2021-06-05 21:51:28,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:28,681 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:51:28,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:28,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:28,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:28,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:28,792 INFO L388 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 12 [2021-06-05 21:51:28,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:28,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:28,795 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:28,796 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:28,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:28,800 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:28,800 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:28,803 INFO L388 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 11 [2021-06-05 21:51:28,804 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:28,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:28,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:28,854 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:51:28,998 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_999, array_2], 1=[v_prenex_1000, array_4]} [2021-06-05 21:51:29,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:51:29,001 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:29,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:51:29,005 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:29,049 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 21:51:29,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:51:29,053 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:29,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:29,076 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1000 vanished before elimination [2021-06-05 21:51:29,079 INFO L388 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 22 treesize of output 14 [2021-06-05 21:51:29,080 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:29,101 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:29,102 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:29,103 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 21:51:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:29,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160356195] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:29,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:29,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:51:29,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408721051] [2021-06-05 21:51:29,176 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:51:29,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:51:29,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:51:29,177 INFO L87 Difference]: Start difference. First operand 884 states and 3311 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:29,661 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2021-06-05 21:51:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:29,969 INFO L93 Difference]: Finished difference Result 939 states and 3443 transitions. [2021-06-05 21:51:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:29,969 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:29,971 INFO L225 Difference]: With dead ends: 939 [2021-06-05 21:51:29,971 INFO L226 Difference]: Without dead ends: 934 [2021-06-05 21:51:29,971 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1158.9ms TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:51:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2021-06-05 21:51:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 880. [2021-06-05 21:51:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7474402730375425) internal successors, (3294), 879 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3294 transitions. [2021-06-05 21:51:29,988 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3294 transitions. Word has length 18 [2021-06-05 21:51:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:29,988 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3294 transitions. [2021-06-05 21:51:29,989 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3294 transitions. [2021-06-05 21:51:29,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:29,990 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:29,990 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:30,211 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4385,369 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:30,211 INFO L430 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -407491060, now seen corresponding path program 223 times [2021-06-05 21:51:30,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:30,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281505975] [2021-06-05 21:51:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:30,495 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2021-06-05 21:51:30,747 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 21:51:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:31,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:31,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281505975] [2021-06-05 21:51:31,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281505975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:31,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993478223] [2021-06-05 21:51:31,107 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:31,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:31,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:31,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:31,256 INFO L388 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 12 [2021-06-05 21:51:31,257 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:31,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:31,260 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:31,261 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:31,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:31,264 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:31,265 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:31,268 INFO L388 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 11 [2021-06-05 21:51:31,269 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:31,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:31,319 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:31,319 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:51:31,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:31,537 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:31,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:31,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:31,540 INFO L388 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 35 treesize of output 27 [2021-06-05 21:51:31,541 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:31,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:31,544 INFO L388 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 11 [2021-06-05 21:51:31,544 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:31,547 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:31,548 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:31,591 INFO L628 ElimStorePlain]: treesize reduction 77, result has 37.4 percent of original size [2021-06-05 21:51:31,593 INFO L388 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 [2021-06-05 21:51:31,594 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:31,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:31,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:31,611 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 21:51:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:31,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993478223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:31,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:31,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 21:51:31,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267679841] [2021-06-05 21:51:31,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 21:51:31,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:31,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 21:51:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:51:31,691 INFO L87 Difference]: Start difference. First operand 880 states and 3294 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:32,325 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2021-06-05 21:51:32,647 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 70 [2021-06-05 21:51:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:32,918 INFO L93 Difference]: Finished difference Result 913 states and 3367 transitions. [2021-06-05 21:51:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:51:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:32,919 INFO L225 Difference]: With dead ends: 913 [2021-06-05 21:51:32,919 INFO L226 Difference]: Without dead ends: 900 [2021-06-05 21:51:32,920 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1933.6ms TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:51:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-06-05 21:51:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 881. [2021-06-05 21:51:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7443181818181817) internal successors, (3295), 880 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3295 transitions. [2021-06-05 21:51:32,929 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3295 transitions. Word has length 18 [2021-06-05 21:51:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:32,929 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3295 transitions. [2021-06-05 21:51:32,929 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3295 transitions. [2021-06-05 21:51:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:32,930 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:32,930 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:33,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4400,370 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:33,130 INFO L430 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash -913837326, now seen corresponding path program 224 times [2021-06-05 21:51:33,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:33,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437221425] [2021-06-05 21:51:33,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:33,586 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2021-06-05 21:51:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:33,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:33,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437221425] [2021-06-05 21:51:33,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437221425] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:33,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039975750] [2021-06-05 21:51:33,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:33,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:51:33,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:33,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:33,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:33,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:33,883 INFO L388 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 12 [2021-06-05 21:51:33,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:33,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:33,887 INFO L388 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 11 [2021-06-05 21:51:33,887 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:33,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:33,890 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:33,891 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:33,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:33,901 INFO L388 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 12 [2021-06-05 21:51:33,902 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:33,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:33,907 INFO L388 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 11 [2021-06-05 21:51:33,908 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:33,912 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:33,913 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:33,982 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:33,983 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:51:33,983 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:135 [2021-06-05 21:51:34,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:51:34,145 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:34,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:51:34,149 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:34,167 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:51:34,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:51:34,171 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:34,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:34,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:34,180 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:51:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:34,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039975750] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:34,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:34,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:51:34,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528483000] [2021-06-05 21:51:34,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:51:34,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:51:34,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:51:34,222 INFO L87 Difference]: Start difference. First operand 881 states and 3295 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:34,771 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-06-05 21:51:34,950 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-06-05 21:51:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:35,038 INFO L93 Difference]: Finished difference Result 909 states and 3358 transitions. [2021-06-05 21:51:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:35,039 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:35,040 INFO L225 Difference]: With dead ends: 909 [2021-06-05 21:51:35,040 INFO L226 Difference]: Without dead ends: 904 [2021-06-05 21:51:35,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1330.4ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:51:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-06-05 21:51:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 881. [2021-06-05 21:51:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7443181818181817) internal successors, (3295), 880 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3295 transitions. [2021-06-05 21:51:35,049 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3295 transitions. Word has length 18 [2021-06-05 21:51:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:35,049 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3295 transitions. [2021-06-05 21:51:35,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3295 transitions. [2021-06-05 21:51:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:35,051 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:35,051 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:35,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 371 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4414 [2021-06-05 21:51:35,251 INFO L430 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash -344762684, now seen corresponding path program 225 times [2021-06-05 21:51:35,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:35,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130478262] [2021-06-05 21:51:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:36,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:36,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130478262] [2021-06-05 21:51:36,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130478262] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:36,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463025304] [2021-06-05 21:51:36,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:36,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:51:36,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:36,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 21:51:36,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:36,247 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:51:36,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 21:51:36,248 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,254 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:51:36,254 INFO L388 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 32 treesize of output 24 [2021-06-05 21:51:36,255 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,262 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 21:51:36,263 INFO L388 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 32 treesize of output 28 [2021-06-05 21:51:36,263 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,268 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:51:36,268 INFO L388 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 42 treesize of output 32 [2021-06-05 21:51:36,269 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,320 INFO L628 ElimStorePlain]: treesize reduction 33, result has 71.3 percent of original size [2021-06-05 21:51:36,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 21:51:36,322 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:78 [2021-06-05 21:51:36,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:36,412 INFO L388 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 11 [2021-06-05 21:51:36,412 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:36,415 INFO L388 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 11 [2021-06-05 21:51:36,416 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:36,419 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:36,420 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:36,423 INFO L388 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 35 treesize of output 27 [2021-06-05 21:51:36,424 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:36,427 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:36,428 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,430 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:36,431 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:36,487 INFO L628 ElimStorePlain]: treesize reduction 103, result has 37.6 percent of original size [2021-06-05 21:51:36,490 INFO L388 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 [2021-06-05 21:51:36,491 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:36,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:36,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 21:51:36,514 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:221, output treesize:54 [2021-06-05 21:51:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:36,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463025304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:36,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:36,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:51:36,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644224826] [2021-06-05 21:51:36,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:51:36,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:36,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:51:36,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:51:36,602 INFO L87 Difference]: Start difference. First operand 881 states and 3295 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:37,261 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2021-06-05 21:51:37,512 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2021-06-05 21:51:37,695 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-06-05 21:51:37,882 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2021-06-05 21:51:38,072 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2021-06-05 21:51:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:38,147 INFO L93 Difference]: Finished difference Result 923 states and 3410 transitions. [2021-06-05 21:51:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:51:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:38,149 INFO L225 Difference]: With dead ends: 923 [2021-06-05 21:51:38,149 INFO L226 Difference]: Without dead ends: 918 [2021-06-05 21:51:38,149 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2022.9ms TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2021-06-05 21:51:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-06-05 21:51:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 879. [2021-06-05 21:51:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.7437357630979498) internal successors, (3287), 878 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3287 transitions. [2021-06-05 21:51:38,158 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3287 transitions. Word has length 18 [2021-06-05 21:51:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:38,158 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3287 transitions. [2021-06-05 21:51:38,158 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3287 transitions. [2021-06-05 21:51:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:38,160 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:38,160 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:38,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4428,372 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:38,360 INFO L430 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1113995740, now seen corresponding path program 226 times [2021-06-05 21:51:38,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:38,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390785650] [2021-06-05 21:51:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:38,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:38,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390785650] [2021-06-05 21:51:38,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390785650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:38,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540677047] [2021-06-05 21:51:38,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:38,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:51:38,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:38,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:38,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:38,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:38,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:38,789 INFO L388 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 12 [2021-06-05 21:51:38,790 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:38,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:38,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:38,794 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:38,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:38,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:38,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:38,798 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:38,799 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:38,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:38,802 INFO L388 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 11 [2021-06-05 21:51:38,802 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:38,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:38,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:38,846 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 21:51:39,133 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 3=[array_4]} [2021-06-05 21:51:39,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:39,136 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:39,137 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:39,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:39,141 INFO L388 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 11 [2021-06-05 21:51:39,141 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:39,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:39,145 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:39,145 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:39,148 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:39,149 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:39,209 INFO L628 ElimStorePlain]: treesize reduction 89, result has 39.5 percent of original size [2021-06-05 21:51:39,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:39,212 INFO L388 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 [2021-06-05 21:51:39,213 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:39,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:39,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:39,236 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:173, output treesize:38 [2021-06-05 21:51:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:39,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540677047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:39,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:39,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 21:51:39,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681439258] [2021-06-05 21:51:39,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:51:39,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:39,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:51:39,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:51:39,304 INFO L87 Difference]: Start difference. First operand 879 states and 3287 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:39,642 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2021-06-05 21:51:39,982 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-06-05 21:51:40,172 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2021-06-05 21:51:40,361 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2021-06-05 21:51:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:40,415 INFO L93 Difference]: Finished difference Result 1188 states and 4247 transitions. [2021-06-05 21:51:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:40,415 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:40,417 INFO L225 Difference]: With dead ends: 1188 [2021-06-05 21:51:40,417 INFO L226 Difference]: Without dead ends: 1169 [2021-06-05 21:51:40,417 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1327.2ms TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:51:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-06-05 21:51:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 884. [2021-06-05 21:51:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.739524348810872) internal successors, (3302), 883 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3302 transitions. [2021-06-05 21:51:40,429 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3302 transitions. Word has length 18 [2021-06-05 21:51:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:40,429 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3302 transitions. [2021-06-05 21:51:40,429 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3302 transitions. [2021-06-05 21:51:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:40,430 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:40,430 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:40,630 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4444,373 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:40,630 INFO L430 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1970491686, now seen corresponding path program 227 times [2021-06-05 21:51:40,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:40,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224399318] [2021-06-05 21:51:40,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:40,928 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:40,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224399318] [2021-06-05 21:51:40,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224399318] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:40,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190896828] [2021-06-05 21:51:40,928 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:40,956 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:51:40,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:40,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:40,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:41,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:41,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:41,053 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:41,053 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:41,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:41,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:41,057 INFO L388 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 11 [2021-06-05 21:51:41,057 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:41,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:41,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:41,060 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:41,061 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:41,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:41,064 INFO L388 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 12 [2021-06-05 21:51:41,065 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:41,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:41,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:41,108 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:115 [2021-06-05 21:51:41,348 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1006], 1=[array_4, v_prenex_1007]} [2021-06-05 21:51:41,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:51:41,352 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:41,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:51:41,355 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:41,391 INFO L628 ElimStorePlain]: treesize reduction 61, result has 44.5 percent of original size [2021-06-05 21:51:41,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:51:41,394 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:41,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:41,405 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:51:41,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:41,408 INFO L388 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 [2021-06-05 21:51:41,409 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:41,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:41,421 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:41,421 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:16 [2021-06-05 21:51:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:41,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190896828] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:41,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:41,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:51:41,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894039675] [2021-06-05 21:51:41,449 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:51:41,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:51:41,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:51:41,450 INFO L87 Difference]: Start difference. First operand 884 states and 3302 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:41,757 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2021-06-05 21:51:42,242 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2021-06-05 21:51:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:42,433 INFO L93 Difference]: Finished difference Result 1157 states and 4179 transitions. [2021-06-05 21:51:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:42,434 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:42,436 INFO L225 Difference]: With dead ends: 1157 [2021-06-05 21:51:42,436 INFO L226 Difference]: Without dead ends: 1152 [2021-06-05 21:51:42,436 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1126.7ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:51:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-06-05 21:51:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 887. [2021-06-05 21:51:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.740406320541761) internal successors, (3314), 886 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3314 transitions. [2021-06-05 21:51:42,447 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3314 transitions. Word has length 18 [2021-06-05 21:51:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:42,447 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3314 transitions. [2021-06-05 21:51:42,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3314 transitions. [2021-06-05 21:51:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:42,448 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:42,448 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:42,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 374 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4460 [2021-06-05 21:51:42,649 INFO L430 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:42,649 INFO L82 PathProgramCache]: Analyzing trace with hash 30502940, now seen corresponding path program 228 times [2021-06-05 21:51:42,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:42,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141701734] [2021-06-05 21:51:42,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:42,949 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:42,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141701734] [2021-06-05 21:51:42,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141701734] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:42,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443489839] [2021-06-05 21:51:42,949 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:42,977 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:51:42,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:42,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:42,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:43,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:43,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:43,067 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:43,068 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:43,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:43,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:43,071 INFO L388 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 11 [2021-06-05 21:51:43,072 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:43,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:43,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:43,075 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:43,076 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:43,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:43,078 INFO L388 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 12 [2021-06-05 21:51:43,079 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:43,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:43,123 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:43,123 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:111 [2021-06-05 21:51:43,301 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1008], 1=[v_prenex_1009, array_4]} [2021-06-05 21:51:43,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:51:43,304 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:43,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:51:43,308 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:43,359 INFO L628 ElimStorePlain]: treesize reduction 84, result has 41.3 percent of original size [2021-06-05 21:51:43,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:51:43,362 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:43,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:43,381 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1009 vanished before elimination [2021-06-05 21:51:43,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:43,384 INFO L388 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 [2021-06-05 21:51:43,385 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:43,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:43,404 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:43,404 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:161, output treesize:44 [2021-06-05 21:51:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:43,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443489839] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:43,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:43,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:51:43,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385330144] [2021-06-05 21:51:43,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:51:43,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:51:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:51:43,480 INFO L87 Difference]: Start difference. First operand 887 states and 3314 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:43,806 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-06-05 21:51:44,411 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2021-06-05 21:51:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:44,471 INFO L93 Difference]: Finished difference Result 1178 states and 4230 transitions. [2021-06-05 21:51:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:44,471 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:44,473 INFO L225 Difference]: With dead ends: 1178 [2021-06-05 21:51:44,473 INFO L226 Difference]: Without dead ends: 1173 [2021-06-05 21:51:44,473 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1156.1ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:51:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-06-05 21:51:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 879. [2021-06-05 21:51:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.7437357630979498) internal successors, (3287), 878 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3287 transitions. [2021-06-05 21:51:44,484 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3287 transitions. Word has length 18 [2021-06-05 21:51:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:44,484 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3287 transitions. [2021-06-05 21:51:44,484 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3287 transitions. [2021-06-05 21:51:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:44,485 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:44,485 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:44,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4479,375 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:44,686 INFO L430 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1815060318, now seen corresponding path program 229 times [2021-06-05 21:51:44,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:44,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933823537] [2021-06-05 21:51:44,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:51:44,733 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:44,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933823537] [2021-06-05 21:51:44,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933823537] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:44,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413744047] [2021-06-05 21:51:44,733 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:44,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 21:51:44,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:44,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:51:44,789 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:44,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:51:44,791 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:44,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:44,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:51:44,807 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:44,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:44,820 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:44,820 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 21:51:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:51:44,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413744047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:44,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:44,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 21:51:44,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224744089] [2021-06-05 21:51:44,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:51:44,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:44,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:51:44,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:51:44,880 INFO L87 Difference]: Start difference. First operand 879 states and 3287 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:45,494 INFO L93 Difference]: Finished difference Result 1446 states and 4960 transitions. [2021-06-05 21:51:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 21:51:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:45,496 INFO L225 Difference]: With dead ends: 1446 [2021-06-05 21:51:45,496 INFO L226 Difference]: Without dead ends: 1326 [2021-06-05 21:51:45,496 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 526.1ms TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:51:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-06-05 21:51:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 894. [2021-06-05 21:51:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 3.753639417693169) internal successors, (3352), 893 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 3352 transitions. [2021-06-05 21:51:45,508 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 3352 transitions. Word has length 18 [2021-06-05 21:51:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:45,508 INFO L482 AbstractCegarLoop]: Abstraction has 894 states and 3352 transitions. [2021-06-05 21:51:45,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 3352 transitions. [2021-06-05 21:51:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:45,510 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:45,510 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:45,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 376 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4496 [2021-06-05 21:51:45,710 INFO L430 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -395611674, now seen corresponding path program 230 times [2021-06-05 21:51:45,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:45,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167032852] [2021-06-05 21:51:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:46,047 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2021-06-05 21:51:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:46,457 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:46,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167032852] [2021-06-05 21:51:46,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167032852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:46,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650617497] [2021-06-05 21:51:46,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:46,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:51:46,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:46,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:46,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:46,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:46,592 INFO L388 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 11 [2021-06-05 21:51:46,593 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:46,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:46,596 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:46,596 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:46,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:46,599 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:46,600 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:46,602 INFO L388 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 12 [2021-06-05 21:51:46,603 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:46,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:46,640 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:46,640 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 21:51:46,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:51:46,839 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:46,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:46,845 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:51:46,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:46,846 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:51:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:46,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650617497] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:46,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:46,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:51:46,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845456138] [2021-06-05 21:51:46,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:51:46,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:51:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:51:46,879 INFO L87 Difference]: Start difference. First operand 894 states and 3352 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:47,378 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2021-06-05 21:51:47,643 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2021-06-05 21:51:47,866 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2021-06-05 21:51:48,127 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2021-06-05 21:51:48,413 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2021-06-05 21:51:48,933 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 21:51:49,160 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2021-06-05 21:51:49,528 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2021-06-05 21:51:49,722 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-06-05 21:51:49,975 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2021-06-05 21:51:50,205 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2021-06-05 21:51:50,436 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2021-06-05 21:51:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:50,479 INFO L93 Difference]: Finished difference Result 1366 states and 4753 transitions. [2021-06-05 21:51:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 21:51:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:50,482 INFO L225 Difference]: With dead ends: 1366 [2021-06-05 21:51:50,482 INFO L226 Difference]: Without dead ends: 1352 [2021-06-05 21:51:50,482 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3808.9ms TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 21:51:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-06-05 21:51:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 902. [2021-06-05 21:51:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 21:51:50,494 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 21:51:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:50,494 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 21:51:50,494 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 21:51:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:50,496 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:50,496 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:50,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4504,377 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:50,696 INFO L430 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:50,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2075094054, now seen corresponding path program 231 times [2021-06-05 21:51:50,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:50,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153283546] [2021-06-05 21:51:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:51,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:51,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153283546] [2021-06-05 21:51:51,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153283546] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:51,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431300810] [2021-06-05 21:51:51,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:51,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:51:51,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:51,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:51,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:51,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:51,236 INFO L388 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 11 [2021-06-05 21:51:51,237 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:51,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:51,239 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:51,240 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:51,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:51,243 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:51,244 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:51,246 INFO L388 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 12 [2021-06-05 21:51:51,247 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:51,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:51,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:51,284 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 21:51:51,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:51:51,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:51,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:51,503 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:51:51,503 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:51,503 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:51:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:51,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431300810] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:51,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:51,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:51:51,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491940094] [2021-06-05 21:51:51,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:51:51,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:51:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:51:51,534 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:51,978 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2021-06-05 21:51:52,281 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2021-06-05 21:51:52,587 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2021-06-05 21:51:52,827 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2021-06-05 21:51:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:53,081 INFO L93 Difference]: Finished difference Result 1134 states and 4071 transitions. [2021-06-05 21:51:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:51:53,081 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:53,083 INFO L225 Difference]: With dead ends: 1134 [2021-06-05 21:51:53,083 INFO L226 Difference]: Without dead ends: 1129 [2021-06-05 21:51:53,083 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1760.7ms TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:51:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-06-05 21:51:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 902. [2021-06-05 21:51:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 21:51:53,094 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 21:51:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:53,094 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 21:51:53,094 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 21:51:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:53,095 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:53,095 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:53,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4515,378 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:53,296 INFO L430 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:53,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:53,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1216089874, now seen corresponding path program 232 times [2021-06-05 21:51:53,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:53,296 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719761522] [2021-06-05 21:51:53,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:53,567 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 21:51:53,699 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2021-06-05 21:51:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:53,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:53,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719761522] [2021-06-05 21:51:53,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719761522] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:53,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695820531] [2021-06-05 21:51:53,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:53,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:51:53,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:53,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:51:53,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:53,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:53,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:53,891 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:53,892 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:53,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:53,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:53,895 INFO L388 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 11 [2021-06-05 21:51:53,896 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:53,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:53,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:53,899 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:53,900 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:53,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:53,903 INFO L388 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 12 [2021-06-05 21:51:53,904 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:53,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:53,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:53,949 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:111 [2021-06-05 21:51:54,257 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 3=[array_4]} [2021-06-05 21:51:54,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:54,261 INFO L388 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 27 treesize of output 21 [2021-06-05 21:51:54,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:54,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:54,265 INFO L388 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 17 treesize of output 13 [2021-06-05 21:51:54,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:54,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:54,270 INFO L388 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 11 [2021-06-05 21:51:54,271 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:54,274 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:54,275 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:54,334 INFO L628 ElimStorePlain]: treesize reduction 83, result has 41.1 percent of original size [2021-06-05 21:51:54,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:54,337 INFO L388 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 [2021-06-05 21:51:54,339 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:54,360 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:54,362 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:54,362 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:173, output treesize:41 [2021-06-05 21:51:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:54,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695820531] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:54,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:54,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 21:51:54,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204685967] [2021-06-05 21:51:54,444 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:51:54,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:51:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:51:54,444 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:54,779 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2021-06-05 21:51:55,071 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2021-06-05 21:51:55,399 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-06-05 21:51:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:55,560 INFO L93 Difference]: Finished difference Result 1112 states and 4026 transitions. [2021-06-05 21:51:55,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:55,561 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:55,562 INFO L225 Difference]: With dead ends: 1112 [2021-06-05 21:51:55,562 INFO L226 Difference]: Without dead ends: 1099 [2021-06-05 21:51:55,563 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1506.1ms TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:51:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-06-05 21:51:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 905. [2021-06-05 21:51:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 3.7488938053097347) internal successors, (3389), 904 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 3389 transitions. [2021-06-05 21:51:55,574 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 3389 transitions. Word has length 18 [2021-06-05 21:51:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:55,574 INFO L482 AbstractCegarLoop]: Abstraction has 905 states and 3389 transitions. [2021-06-05 21:51:55,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 3389 transitions. [2021-06-05 21:51:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:55,575 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:55,575 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:55,775 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4528,379 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:55,776 INFO L430 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash -723898872, now seen corresponding path program 233 times [2021-06-05 21:51:55,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:55,776 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421403407] [2021-06-05 21:51:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:56,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:56,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421403407] [2021-06-05 21:51:56,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421403407] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:56,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316574342] [2021-06-05 21:51:56,093 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:56,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:51:56,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:56,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:56,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:56,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:56,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:56,208 INFO L388 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 12 [2021-06-05 21:51:56,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:56,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:56,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:56,212 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:56,213 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:56,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:56,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:56,216 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:56,217 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:56,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:56,220 INFO L388 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 11 [2021-06-05 21:51:56,221 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:56,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:56,265 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:56,265 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 21:51:56,462 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1011], 1=[array_4, v_prenex_1012]} [2021-06-05 21:51:56,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:51:56,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:56,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:51:56,469 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:56,522 INFO L628 ElimStorePlain]: treesize reduction 87, result has 39.2 percent of original size [2021-06-05 21:51:56,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:51:56,525 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:56,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:56,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:56,547 INFO L388 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 [2021-06-05 21:51:56,548 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:56,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:56,566 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1012 vanished before elimination [2021-06-05 21:51:56,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:56,567 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 21:51:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:56,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316574342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:56,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:56,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:51:56,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923500452] [2021-06-05 21:51:56,644 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:51:56,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:51:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:51:56,644 INFO L87 Difference]: Start difference. First operand 905 states and 3389 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:57,013 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2021-06-05 21:51:57,290 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2021-06-05 21:51:57,433 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-06-05 21:51:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:51:57,793 INFO L93 Difference]: Finished difference Result 1129 states and 4070 transitions. [2021-06-05 21:51:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:51:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:51:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:51:57,795 INFO L225 Difference]: With dead ends: 1129 [2021-06-05 21:51:57,795 INFO L226 Difference]: Without dead ends: 1124 [2021-06-05 21:51:57,795 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1315.2ms TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:51:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-06-05 21:51:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 902. [2021-06-05 21:51:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 21:51:57,806 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 21:51:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:51:57,806 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 21:51:57,806 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 21:51:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:51:57,807 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:51:57,807 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:51:58,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4546,380 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:58,008 INFO L430 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:51:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:51:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash 474656200, now seen corresponding path program 234 times [2021-06-05 21:51:58,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:51:58,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050608881] [2021-06-05 21:51:58,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:51:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:51:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:58,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:51:58,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050608881] [2021-06-05 21:51:58,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050608881] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:58,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327363400] [2021-06-05 21:51:58,388 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:51:58,417 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:51:58,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:51:58,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:51:58,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:51:58,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:58,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:58,530 INFO L388 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 12 [2021-06-05 21:51:58,531 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:58,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:58,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:58,535 INFO L388 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 26 treesize of output 20 [2021-06-05 21:51:58,536 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:58,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:58,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:58,539 INFO L388 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 25 treesize of output 19 [2021-06-05 21:51:58,540 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:58,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:58,543 INFO L388 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 11 [2021-06-05 21:51:58,544 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:58,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:58,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:51:58,588 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 21:51:58,940 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2021-06-05 21:51:59,056 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1019], 1=[v_prenex_1020, array_4]} [2021-06-05 21:51:59,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:51:59,060 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:59,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:51:59,063 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:59,099 INFO L628 ElimStorePlain]: treesize reduction 63, result has 42.7 percent of original size [2021-06-05 21:51:59,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:51:59,102 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:51:59,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:59,113 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1020 vanished before elimination [2021-06-05 21:51:59,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:51:59,115 INFO L388 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 [2021-06-05 21:51:59,116 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:51:59,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:51:59,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:51:59,128 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 21:51:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:51:59,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327363400] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:51:59,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:51:59,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:51:59,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973721819] [2021-06-05 21:51:59,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:51:59,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:51:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:51:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:51:59,159 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:51:59,540 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 21:51:59,823 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-06-05 21:52:00,242 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 121 [2021-06-05 21:52:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:00,548 INFO L93 Difference]: Finished difference Result 1102 states and 4004 transitions. [2021-06-05 21:52:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:00,550 INFO L225 Difference]: With dead ends: 1102 [2021-06-05 21:52:00,550 INFO L226 Difference]: Without dead ends: 1097 [2021-06-05 21:52:00,550 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1740.3ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:52:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-06-05 21:52:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 902. [2021-06-05 21:52:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 21:52:00,561 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 21:52:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:00,561 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 21:52:00,561 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 21:52:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:00,562 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:00,563 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:00,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 381 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4562 [2021-06-05 21:52:00,763 INFO L430 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash -736738304, now seen corresponding path program 235 times [2021-06-05 21:52:00,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:00,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006495443] [2021-06-05 21:52:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:00,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:00,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006495443] [2021-06-05 21:52:00,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006495443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:00,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633925253] [2021-06-05 21:52:00,966 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:00,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:52:00,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:01,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,187 INFO L388 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 11 [2021-06-05 21:52:01,187 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,192 INFO L388 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 11 [2021-06-05 21:52:01,192 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,198 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:01,199 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,205 INFO L388 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 12 [2021-06-05 21:52:01,206 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,212 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:01,213 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,217 INFO L388 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 12 [2021-06-05 21:52:01,218 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:01,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 21:52:01,306 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:221, output treesize:175 [2021-06-05 21:52:01,648 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 21:52:01,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,652 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:01,653 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,657 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:01,658 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,661 INFO L388 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 11 [2021-06-05 21:52:01,662 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,665 INFO L388 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 35 treesize of output 27 [2021-06-05 21:52:01,666 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,717 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 21:52:01,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:01,720 INFO L388 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 22 treesize of output 14 [2021-06-05 21:52:01,721 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:01,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:01,744 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:01,744 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:181, output treesize:41 [2021-06-05 21:52:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:01,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633925253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:01,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:01,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 21:52:01,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159367834] [2021-06-05 21:52:01,832 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:52:01,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:01,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:52:01,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:52:01,832 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:02,400 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 115 [2021-06-05 21:52:02,727 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2021-06-05 21:52:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:03,038 INFO L93 Difference]: Finished difference Result 1106 states and 4003 transitions. [2021-06-05 21:52:03,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:03,038 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:03,040 INFO L225 Difference]: With dead ends: 1106 [2021-06-05 21:52:03,040 INFO L226 Difference]: Without dead ends: 1093 [2021-06-05 21:52:03,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1457.8ms TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:52:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-06-05 21:52:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 904. [2021-06-05 21:52:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.7475083056478407) internal successors, (3384), 903 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3384 transitions. [2021-06-05 21:52:03,051 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 3384 transitions. Word has length 18 [2021-06-05 21:52:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:03,051 INFO L482 AbstractCegarLoop]: Abstraction has 904 states and 3384 transitions. [2021-06-05 21:52:03,051 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 3384 transitions. [2021-06-05 21:52:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:03,052 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:03,052 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:03,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4588,382 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:03,252 INFO L430 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1451444872, now seen corresponding path program 236 times [2021-06-05 21:52:03,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:03,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787530843] [2021-06-05 21:52:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:03,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:03,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787530843] [2021-06-05 21:52:03,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787530843] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:03,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660166906] [2021-06-05 21:52:03,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:03,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:52:03,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:03,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:03,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:03,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:03,950 INFO L388 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 12 [2021-06-05 21:52:03,951 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:03,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:03,954 INFO L388 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 11 [2021-06-05 21:52:03,955 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:03,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:03,958 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:03,959 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:03,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:03,962 INFO L388 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 12 [2021-06-05 21:52:03,963 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:03,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:03,966 INFO L388 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 11 [2021-06-05 21:52:03,966 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:03,969 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:03,970 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:04,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:04,019 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:52:04,019 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:139 [2021-06-05 21:52:04,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:52:04,144 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:04,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:04,151 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:52:04,151 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:04,151 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:52:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:04,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660166906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:04,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:04,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:52:04,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008286463] [2021-06-05 21:52:04,183 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:52:04,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:52:04,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:52:04,184 INFO L87 Difference]: Start difference. First operand 904 states and 3384 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:04,810 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2021-06-05 21:52:05,073 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2021-06-05 21:52:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:05,362 INFO L93 Difference]: Finished difference Result 1073 states and 3938 transitions. [2021-06-05 21:52:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:05,362 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:05,364 INFO L225 Difference]: With dead ends: 1073 [2021-06-05 21:52:05,364 INFO L226 Difference]: Without dead ends: 1068 [2021-06-05 21:52:05,364 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1531.4ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:52:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-06-05 21:52:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 904. [2021-06-05 21:52:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.7475083056478407) internal successors, (3384), 903 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3384 transitions. [2021-06-05 21:52:05,375 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 3384 transitions. Word has length 18 [2021-06-05 21:52:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:05,375 INFO L482 AbstractCegarLoop]: Abstraction has 904 states and 3384 transitions. [2021-06-05 21:52:05,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 3384 transitions. [2021-06-05 21:52:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:05,376 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:05,376 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:05,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 383 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4603 [2021-06-05 21:52:05,577 INFO L430 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash 330291594, now seen corresponding path program 237 times [2021-06-05 21:52:05,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:05,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974003445] [2021-06-05 21:52:05,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:05,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:05,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974003445] [2021-06-05 21:52:05,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974003445] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:05,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739547898] [2021-06-05 21:52:05,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:05,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:52:05,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:05,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:52:05,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:06,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:06,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:06,104 INFO L388 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 12 [2021-06-05 21:52:06,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:06,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:06,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:06,109 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:06,109 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:06,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:06,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:06,113 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:06,114 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:06,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:06,117 INFO L388 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 11 [2021-06-05 21:52:06,118 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:06,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:06,183 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:06,183 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:167 [2021-06-05 21:52:06,458 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1030], 1=[v_prenex_1031, array_4]} [2021-06-05 21:52:06,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:52:06,462 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:06,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:52:06,465 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:06,501 INFO L628 ElimStorePlain]: treesize reduction 65, result has 43.0 percent of original size [2021-06-05 21:52:06,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:52:06,504 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:06,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:06,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:06,517 INFO L388 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 22 treesize of output 14 [2021-06-05 21:52:06,518 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:06,529 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:06,529 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:52:06,530 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:06,530 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:16 [2021-06-05 21:52:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:06,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739547898] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:06,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:06,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:52:06,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406326828] [2021-06-05 21:52:06,559 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:52:06,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:52:06,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:52:06,560 INFO L87 Difference]: Start difference. First operand 904 states and 3384 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:07,076 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-06-05 21:52:07,396 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-06-05 21:52:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:07,528 INFO L93 Difference]: Finished difference Result 1073 states and 3943 transitions. [2021-06-05 21:52:07,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:07,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:07,531 INFO L225 Difference]: With dead ends: 1073 [2021-06-05 21:52:07,531 INFO L226 Difference]: Without dead ends: 1068 [2021-06-05 21:52:07,531 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1257.1ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:52:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-06-05 21:52:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 907. [2021-06-05 21:52:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 3.748344370860927) internal successors, (3396), 906 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 3396 transitions. [2021-06-05 21:52:07,542 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 3396 transitions. Word has length 18 [2021-06-05 21:52:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:07,543 INFO L482 AbstractCegarLoop]: Abstraction has 907 states and 3396 transitions. [2021-06-05 21:52:07,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 3396 transitions. [2021-06-05 21:52:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:07,544 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:07,544 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:07,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4617,384 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:07,744 INFO L430 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1609697152, now seen corresponding path program 238 times [2021-06-05 21:52:07,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:07,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329691786] [2021-06-05 21:52:07,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:08,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:08,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329691786] [2021-06-05 21:52:08,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329691786] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:08,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042277670] [2021-06-05 21:52:08,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:08,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:52:08,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:08,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 21:52:08,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:08,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:08,598 INFO L388 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 12 [2021-06-05 21:52:08,599 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:08,602 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:08,603 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:08,606 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:08,607 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,610 INFO L388 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 11 [2021-06-05 21:52:08,611 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:08,667 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:08,667 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:181, output treesize:149 [2021-06-05 21:52:08,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:08,823 INFO L388 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 11 [2021-06-05 21:52:08,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:08,827 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:08,828 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:08,831 INFO L388 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 35 treesize of output 27 [2021-06-05 21:52:08,832 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,834 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:08,835 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,895 INFO L628 ElimStorePlain]: treesize reduction 87, result has 42.4 percent of original size [2021-06-05 21:52:08,897 INFO L388 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 22 treesize of output 14 [2021-06-05 21:52:08,898 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:08,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:08,923 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:08,924 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:181, output treesize:50 [2021-06-05 21:52:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:09,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042277670] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:09,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:09,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 21:52:09,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131924382] [2021-06-05 21:52:09,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:52:09,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:52:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:52:09,056 INFO L87 Difference]: Start difference. First operand 907 states and 3396 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:09,525 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2021-06-05 21:52:09,696 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-06-05 21:52:10,005 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-06-05 21:52:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:10,307 INFO L93 Difference]: Finished difference Result 1109 states and 4032 transitions. [2021-06-05 21:52:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:52:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:10,309 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 21:52:10,309 INFO L226 Difference]: Without dead ends: 1092 [2021-06-05 21:52:10,309 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1787.2ms TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:52:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-06-05 21:52:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 908. [2021-06-05 21:52:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 3.7497243660418964) internal successors, (3401), 907 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 3401 transitions. [2021-06-05 21:52:10,319 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 3401 transitions. Word has length 18 [2021-06-05 21:52:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:10,319 INFO L482 AbstractCegarLoop]: Abstraction has 908 states and 3401 transitions. [2021-06-05 21:52:10,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 3401 transitions. [2021-06-05 21:52:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:10,321 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:10,321 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:10,521 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4635,385 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:10,521 INFO L430 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash -317781726, now seen corresponding path program 239 times [2021-06-05 21:52:10,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:10,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492509267] [2021-06-05 21:52:10,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:52:10,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:10,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492509267] [2021-06-05 21:52:10,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492509267] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:10,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518607852] [2021-06-05 21:52:10,556 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:10,585 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:52:10,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:10,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 21:52:10,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:10,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:10,617 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:10,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:52:10,619 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:10,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:10,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:52:10,635 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:10,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:10,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:10,648 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 21:52:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:52:10,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518607852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:10,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:10,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 21:52:10,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989657544] [2021-06-05 21:52:10,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 21:52:10,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 21:52:10,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 21:52:10,685 INFO L87 Difference]: Start difference. First operand 908 states and 3401 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:10,851 INFO L93 Difference]: Finished difference Result 1155 states and 4246 transitions. [2021-06-05 21:52:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 21:52:10,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:10,853 INFO L225 Difference]: With dead ends: 1155 [2021-06-05 21:52:10,853 INFO L226 Difference]: Without dead ends: 1089 [2021-06-05 21:52:10,853 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 133.0ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:52:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-06-05 21:52:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 836. [2021-06-05 21:52:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 3.7664670658682633) internal successors, (3145), 835 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 3145 transitions. [2021-06-05 21:52:10,863 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 3145 transitions. Word has length 18 [2021-06-05 21:52:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:10,864 INFO L482 AbstractCegarLoop]: Abstraction has 836 states and 3145 transitions. [2021-06-05 21:52:10,864 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 3145 transitions. [2021-06-05 21:52:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:10,865 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:10,865 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:11,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4648,386 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:11,065 INFO L430 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:11,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1445800362, now seen corresponding path program 240 times [2021-06-05 21:52:11,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:11,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784643361] [2021-06-05 21:52:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:11,635 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:11,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784643361] [2021-06-05 21:52:11,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784643361] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:11,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139965772] [2021-06-05 21:52:11,635 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:11,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:52:11,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:11,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:11,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:11,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,806 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:11,807 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,810 INFO L388 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 12 [2021-06-05 21:52:11,811 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,814 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:11,815 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,818 INFO L388 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 11 [2021-06-05 21:52:11,819 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,822 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:11,823 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,826 INFO L388 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 12 [2021-06-05 21:52:11,827 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,830 INFO L388 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 11 [2021-06-05 21:52:11,830 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,833 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:11,834 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:11,837 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:11,838 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,840 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:11,841 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:11,932 INFO L628 ElimStorePlain]: treesize reduction 92, result has 57.2 percent of original size [2021-06-05 21:52:11,933 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:52:11,933 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:305, output treesize:123 [2021-06-05 21:52:12,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:52:12,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:12,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:52:12,128 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:12,142 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:52:12,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:52:12,144 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:12,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:12,151 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:12,151 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:52:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:12,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139965772] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:12,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:12,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:52:12,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102532586] [2021-06-05 21:52:12,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:52:12,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:52:12,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:52:12,185 INFO L87 Difference]: Start difference. First operand 836 states and 3145 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:12,854 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 72 [2021-06-05 21:52:13,416 WARN L205 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-06-05 21:52:13,562 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2021-06-05 21:52:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:13,774 INFO L93 Difference]: Finished difference Result 1024 states and 3736 transitions. [2021-06-05 21:52:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:13,775 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:13,776 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 21:52:13,776 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 21:52:13,776 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1989.9ms TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:52:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 21:52:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 831. [2021-06-05 21:52:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 3.7771084337349397) internal successors, (3135), 830 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 3135 transitions. [2021-06-05 21:52:13,786 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 3135 transitions. Word has length 18 [2021-06-05 21:52:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:13,786 INFO L482 AbstractCegarLoop]: Abstraction has 831 states and 3135 transitions. [2021-06-05 21:52:13,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 3135 transitions. [2021-06-05 21:52:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:13,787 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:13,787 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:13,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4654,387 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:13,988 INFO L430 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash -894215328, now seen corresponding path program 241 times [2021-06-05 21:52:13,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:13,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553669187] [2021-06-05 21:52:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:14,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:14,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553669187] [2021-06-05 21:52:14,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553669187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:14,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499639309] [2021-06-05 21:52:14,060 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:14,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:52:14,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:14,219 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1033, v_prenex_1032, v_prenex_1035, v_prenex_1034], 1=[array_0]} [2021-06-05 21:52:14,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:52:14,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,266 INFO L628 ElimStorePlain]: treesize reduction 49, result has 59.5 percent of original size [2021-06-05 21:52:14,267 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1032 vanished before elimination [2021-06-05 21:52:14,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:14,270 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:14,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:14,291 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:14,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:14,309 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:14,310 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,325 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:14,326 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2021-06-05 21:52:14,326 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:45 [2021-06-05 21:52:14,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:14,390 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:14,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:14,394 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:14,397 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:14,401 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:14,404 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:14,408 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:14,411 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,413 INFO L388 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 19 treesize of output 15 [2021-06-05 21:52:14,414 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:14,454 INFO L628 ElimStorePlain]: treesize reduction 55, result has 39.6 percent of original size [2021-06-05 21:52:14,455 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:52:14,456 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:14,456 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:161, output treesize:30 [2021-06-05 21:52:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:14,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499639309] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:14,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:14,490 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:52:14,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198051067] [2021-06-05 21:52:14,490 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:52:14,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:14,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:52:14,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:52:14,490 INFO L87 Difference]: Start difference. First operand 831 states and 3135 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:15,146 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-06-05 21:52:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:16,577 INFO L93 Difference]: Finished difference Result 1097 states and 3888 transitions. [2021-06-05 21:52:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 21:52:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:16,579 INFO L225 Difference]: With dead ends: 1097 [2021-06-05 21:52:16,579 INFO L226 Difference]: Without dead ends: 1044 [2021-06-05 21:52:16,579 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1710.8ms TimeCoverageRelationStatistics Valid=451, Invalid=1901, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 21:52:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2021-06-05 21:52:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 848. [2021-06-05 21:52:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 3.728453364817001) internal successors, (3158), 847 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 3158 transitions. [2021-06-05 21:52:16,589 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 3158 transitions. Word has length 18 [2021-06-05 21:52:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:16,589 INFO L482 AbstractCegarLoop]: Abstraction has 848 states and 3158 transitions. [2021-06-05 21:52:16,590 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 3158 transitions. [2021-06-05 21:52:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:16,591 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:16,591 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:16,791 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4666,388 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:16,791 INFO L430 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1989681178, now seen corresponding path program 242 times [2021-06-05 21:52:16,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:16,791 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985728622] [2021-06-05 21:52:16,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:17,029 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:17,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985728622] [2021-06-05 21:52:17,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985728622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:17,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320007294] [2021-06-05 21:52:17,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:17,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:52:17,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:17,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:17,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:17,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,328 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:17,329 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,333 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:17,333 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,337 INFO L388 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 12 [2021-06-05 21:52:17,338 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,342 INFO L388 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 11 [2021-06-05 21:52:17,343 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,347 INFO L388 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 12 [2021-06-05 21:52:17,348 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,351 INFO L388 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 11 [2021-06-05 21:52:17,352 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:17,429 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 21:52:17,429 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:221, output treesize:171 [2021-06-05 21:52:17,632 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1041], 1=[v_prenex_1042, array_4]} [2021-06-05 21:52:17,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:52:17,636 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:52:17,639 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,675 INFO L628 ElimStorePlain]: treesize reduction 59, result has 44.3 percent of original size [2021-06-05 21:52:17,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:52:17,678 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:17,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:17,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:17,692 INFO L388 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 [2021-06-05 21:52:17,693 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:17,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:17,704 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:52:17,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:17,705 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 21:52:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:17,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320007294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:17,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:17,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 21:52:17,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023916874] [2021-06-05 21:52:17,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:52:17,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:52:17,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:52:17,737 INFO L87 Difference]: Start difference. First operand 848 states and 3158 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:18,538 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 71 [2021-06-05 21:52:19,011 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2021-06-05 21:52:19,331 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 75 [2021-06-05 21:52:19,567 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 86 [2021-06-05 21:52:19,789 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 71 [2021-06-05 21:52:20,025 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2021-06-05 21:52:20,444 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2021-06-05 21:52:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:20,506 INFO L93 Difference]: Finished difference Result 1045 states and 3810 transitions. [2021-06-05 21:52:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 21:52:20,506 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:20,508 INFO L225 Difference]: With dead ends: 1045 [2021-06-05 21:52:20,508 INFO L226 Difference]: Without dead ends: 1026 [2021-06-05 21:52:20,508 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2609.4ms TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 21:52:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-06-05 21:52:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 847. [2021-06-05 21:52:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 3.730496453900709) internal successors, (3156), 846 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 3156 transitions. [2021-06-05 21:52:20,520 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 3156 transitions. Word has length 18 [2021-06-05 21:52:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:20,520 INFO L482 AbstractCegarLoop]: Abstraction has 847 states and 3156 transitions. [2021-06-05 21:52:20,520 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 3156 transitions. [2021-06-05 21:52:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:20,522 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:20,522 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:20,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 389 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4681 [2021-06-05 21:52:20,722 INFO L430 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:20,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash 879584916, now seen corresponding path program 243 times [2021-06-05 21:52:20,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:20,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930048102] [2021-06-05 21:52:20,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:20,798 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:20,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930048102] [2021-06-05 21:52:20,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930048102] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:20,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392967226] [2021-06-05 21:52:20,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:20,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:52:20,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:20,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 21:52:20,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:20,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:20,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:20,887 INFO L628 ElimStorePlain]: treesize reduction 1, result has 97.2 percent of original size [2021-06-05 21:52:20,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:20,890 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:20,901 INFO L628 ElimStorePlain]: treesize reduction 15, result has 44.4 percent of original size [2021-06-05 21:52:20,902 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:52:20,902 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:12 [2021-06-05 21:52:20,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:20,932 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:20,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:52:20,935 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:20,947 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:20,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:52:20,950 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:20,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:20,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:20,963 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 21:52:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:21,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392967226] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:21,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:21,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2021-06-05 21:52:21,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3708466] [2021-06-05 21:52:21,022 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:21,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:21,022 INFO L87 Difference]: Start difference. First operand 847 states and 3156 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:22,496 INFO L93 Difference]: Finished difference Result 1612 states and 5528 transitions. [2021-06-05 21:52:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 21:52:22,496 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:22,498 INFO L225 Difference]: With dead ends: 1612 [2021-06-05 21:52:22,499 INFO L226 Difference]: Without dead ends: 1481 [2021-06-05 21:52:22,499 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1145.7ms TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 21:52:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-06-05 21:52:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 922. [2021-06-05 21:52:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 3.807817589576547) internal successors, (3507), 921 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3507 transitions. [2021-06-05 21:52:22,512 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 3507 transitions. Word has length 18 [2021-06-05 21:52:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:22,512 INFO L482 AbstractCegarLoop]: Abstraction has 922 states and 3507 transitions. [2021-06-05 21:52:22,512 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 3507 transitions. [2021-06-05 21:52:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:22,513 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:22,514 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:22,714 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 390 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4704 [2021-06-05 21:52:22,714 INFO L430 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:22,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1052832608, now seen corresponding path program 244 times [2021-06-05 21:52:22,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:22,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820666631] [2021-06-05 21:52:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:52:22,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:22,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820666631] [2021-06-05 21:52:22,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820666631] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:22,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931444662] [2021-06-05 21:52:22,759 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:22,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:52:22,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:22,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:52:22,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:22,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:22,871 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:22,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:22,874 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:22,874 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:22,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:22,877 INFO L388 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 12 [2021-06-05 21:52:22,878 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:22,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:22,881 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:22,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:22,884 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:22,886 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:22,887 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:22,922 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 21:52:22,923 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:22,923 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 21:52:22,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:52:22,985 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:22,988 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 21:52:22,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:52:22,991 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:22,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:22,992 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:22,992 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 21:52:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:23,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931444662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:23,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:23,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:52:23,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090181899] [2021-06-05 21:52:23,000 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:23,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:23,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:23,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:23,000 INFO L87 Difference]: Start difference. First operand 922 states and 3507 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:25,214 INFO L93 Difference]: Finished difference Result 1987 states and 7216 transitions. [2021-06-05 21:52:25,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 21:52:25,214 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:25,217 INFO L225 Difference]: With dead ends: 1987 [2021-06-05 21:52:25,217 INFO L226 Difference]: Without dead ends: 1809 [2021-06-05 21:52:25,217 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1549.0ms TimeCoverageRelationStatistics Valid=676, Invalid=2864, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 21:52:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2021-06-05 21:52:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1021. [2021-06-05 21:52:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.91078431372549) internal successors, (3989), 1020 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 3989 transitions. [2021-06-05 21:52:25,233 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 3989 transitions. Word has length 18 [2021-06-05 21:52:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:25,233 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 3989 transitions. [2021-06-05 21:52:25,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 3989 transitions. [2021-06-05 21:52:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:25,234 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:25,235 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:25,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4711,391 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:25,435 INFO L430 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1207604144, now seen corresponding path program 245 times [2021-06-05 21:52:25,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:25,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575103602] [2021-06-05 21:52:25,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:25,511 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:25,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575103602] [2021-06-05 21:52:25,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575103602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:25,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233641242] [2021-06-05 21:52:25,511 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:25,539 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:52:25,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:25,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 21:52:25,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:25,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:25,562 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:25,576 INFO L628 ElimStorePlain]: treesize reduction 2, result has 89.5 percent of original size [2021-06-05 21:52:25,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:25,579 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:25,582 INFO L628 ElimStorePlain]: treesize reduction 6, result has 33.3 percent of original size [2021-06-05 21:52:25,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:52:25,583 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2021-06-05 21:52:25,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:25,615 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:25,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:52:25,617 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:25,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:25,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:52:25,633 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:25,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:25,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:25,646 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 21:52:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:25,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233641242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:25,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:25,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2021-06-05 21:52:25,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851361038] [2021-06-05 21:52:25,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:25,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:25,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:25,708 INFO L87 Difference]: Start difference. First operand 1021 states and 3989 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:27,010 INFO L93 Difference]: Finished difference Result 1795 states and 6714 transitions. [2021-06-05 21:52:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 21:52:27,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:27,013 INFO L225 Difference]: With dead ends: 1795 [2021-06-05 21:52:27,013 INFO L226 Difference]: Without dead ends: 1708 [2021-06-05 21:52:27,013 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 981.4ms TimeCoverageRelationStatistics Valid=473, Invalid=2283, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 21:52:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2021-06-05 21:52:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1070. [2021-06-05 21:52:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 3.9747427502338635) internal successors, (4249), 1069 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 4249 transitions. [2021-06-05 21:52:27,029 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 4249 transitions. Word has length 18 [2021-06-05 21:52:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:27,029 INFO L482 AbstractCegarLoop]: Abstraction has 1070 states and 4249 transitions. [2021-06-05 21:52:27,029 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 4249 transitions. [2021-06-05 21:52:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:27,030 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:27,030 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:27,230 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4721,392 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:27,231 INFO L430 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash 960983972, now seen corresponding path program 246 times [2021-06-05 21:52:27,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:27,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268744123] [2021-06-05 21:52:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:27,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:27,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268744123] [2021-06-05 21:52:27,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268744123] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:27,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279919721] [2021-06-05 21:52:27,303 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:27,331 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:52:27,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:27,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:52:27,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:27,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:27,435 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:27,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:27,439 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:27,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:27,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:27,442 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:27,442 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:27,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:27,446 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:27,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:27,449 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:27,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:27,451 INFO L388 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 12 [2021-06-05 21:52:27,452 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:27,493 INFO L628 ElimStorePlain]: treesize reduction 22, result has 66.7 percent of original size [2021-06-05 21:52:27,495 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2021-06-05 21:52:27,495 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:119, output treesize:38 [2021-06-05 21:52:27,598 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1046, v_prenex_1045], 1=[array_0, array_2]} [2021-06-05 21:52:27,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:52:27,601 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:27,631 INFO L628 ElimStorePlain]: treesize reduction 52, result has 42.2 percent of original size [2021-06-05 21:52:27,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 21:52:27,634 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:27,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:27,647 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 21:52:27,647 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:52:27,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:27,647 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:30 [2021-06-05 21:52:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:27,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279919721] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:27,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:27,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:52:27,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040003750] [2021-06-05 21:52:27,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:52:27,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:27,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:52:27,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:52:27,686 INFO L87 Difference]: Start difference. First operand 1070 states and 4249 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:29,055 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 21:52:29,562 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2021-06-05 21:52:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:30,028 INFO L93 Difference]: Finished difference Result 1513 states and 5765 transitions. [2021-06-05 21:52:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 21:52:30,029 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:30,031 INFO L225 Difference]: With dead ends: 1513 [2021-06-05 21:52:30,031 INFO L226 Difference]: Without dead ends: 1482 [2021-06-05 21:52:30,031 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1836.9ms TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 21:52:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2021-06-05 21:52:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1071. [2021-06-05 21:52:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 3.9598130841121497) internal successors, (4237), 1070 states have internal predecessors, (4237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 4237 transitions. [2021-06-05 21:52:30,045 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 4237 transitions. Word has length 18 [2021-06-05 21:52:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:30,045 INFO L482 AbstractCegarLoop]: Abstraction has 1071 states and 4237 transitions. [2021-06-05 21:52:30,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 4237 transitions. [2021-06-05 21:52:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:30,046 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:30,047 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:30,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4727,393 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:30,247 INFO L430 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:30,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1134231664, now seen corresponding path program 247 times [2021-06-05 21:52:30,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:30,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580535168] [2021-06-05 21:52:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:52:30,287 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:30,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580535168] [2021-06-05 21:52:30,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580535168] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:30,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485090331] [2021-06-05 21:52:30,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:30,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:52:30,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:30,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:30,383 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:30,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:30,386 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:30,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:30,388 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:30,389 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:30,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:30,392 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:30,394 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:30,394 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:30,396 INFO L388 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 12 [2021-06-05 21:52:30,397 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:30,425 INFO L628 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2021-06-05 21:52:30,426 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:30,426 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:107, output treesize:32 [2021-06-05 21:52:30,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:52:30,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:30,509 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 21:52:30,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:52:30,511 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:30,512 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:30,513 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:30,513 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 21:52:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:30,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485090331] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:30,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:30,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:52:30,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510609901] [2021-06-05 21:52:30,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:30,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:30,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:30,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:30,526 INFO L87 Difference]: Start difference. First operand 1071 states and 4237 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:31,666 INFO L93 Difference]: Finished difference Result 1440 states and 5539 transitions. [2021-06-05 21:52:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 21:52:31,666 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:31,668 INFO L225 Difference]: With dead ends: 1440 [2021-06-05 21:52:31,668 INFO L226 Difference]: Without dead ends: 1401 [2021-06-05 21:52:31,669 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 785.5ms TimeCoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 21:52:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2021-06-05 21:52:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1057. [2021-06-05 21:52:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1056 states have (on average 3.949810606060606) internal successors, (4171), 1056 states have internal predecessors, (4171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 4171 transitions. [2021-06-05 21:52:31,682 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 4171 transitions. Word has length 18 [2021-06-05 21:52:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:31,682 INFO L482 AbstractCegarLoop]: Abstraction has 1057 states and 4171 transitions. [2021-06-05 21:52:31,682 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 4171 transitions. [2021-06-05 21:52:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:31,683 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:31,683 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:31,883 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4742,394 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:31,883 INFO L430 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1136857440, now seen corresponding path program 248 times [2021-06-05 21:52:31,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:31,884 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228439988] [2021-06-05 21:52:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:52:31,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:31,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228439988] [2021-06-05 21:52:31,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228439988] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:31,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318455325] [2021-06-05 21:52:31,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:31,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:52:31,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:31,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:52:31,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:32,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:32,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:32,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:52:32,015 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:32,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:32,018 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:32,019 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:32,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:32,022 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:32,024 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:32,024 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:32,026 INFO L388 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 12 [2021-06-05 21:52:32,027 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:32,055 INFO L628 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2021-06-05 21:52:32,055 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:32,055 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:107, output treesize:32 [2021-06-05 21:52:32,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 21:52:32,122 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:32,125 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 21:52:32,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 21:52:32,127 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:32,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:32,129 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:32,129 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 21:52:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:32,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318455325] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:32,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:32,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:52:32,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003813104] [2021-06-05 21:52:32,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:32,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:32,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:32,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:32,137 INFO L87 Difference]: Start difference. First operand 1057 states and 4171 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:33,290 INFO L93 Difference]: Finished difference Result 1648 states and 6288 transitions. [2021-06-05 21:52:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 21:52:33,290 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:33,292 INFO L225 Difference]: With dead ends: 1648 [2021-06-05 21:52:33,292 INFO L226 Difference]: Without dead ends: 1599 [2021-06-05 21:52:33,292 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 817.4ms TimeCoverageRelationStatistics Valid=371, Invalid=1435, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 21:52:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2021-06-05 21:52:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1037. [2021-06-05 21:52:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 3.948841698841699) internal successors, (4091), 1036 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 4091 transitions. [2021-06-05 21:52:33,307 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 4091 transitions. Word has length 18 [2021-06-05 21:52:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:33,307 INFO L482 AbstractCegarLoop]: Abstraction has 1037 states and 4091 transitions. [2021-06-05 21:52:33,307 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 4091 transitions. [2021-06-05 21:52:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:33,308 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:33,308 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:33,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4752,395 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:33,508 INFO L430 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash -905881326, now seen corresponding path program 249 times [2021-06-05 21:52:33,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:33,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052174925] [2021-06-05 21:52:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:33,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:33,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052174925] [2021-06-05 21:52:33,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052174925] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:33,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523404425] [2021-06-05 21:52:33,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:33,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:52:33,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:33,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:52:33,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:33,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:33,663 INFO L388 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 11 [2021-06-05 21:52:33,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:33,666 INFO L388 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 12 [2021-06-05 21:52:33,667 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:33,670 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:33,671 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,673 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:33,674 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:33,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:33,705 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 21:52:33,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:33,803 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:33,804 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,806 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:33,807 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:33,810 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:33,814 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:52:33,817 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,819 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:33,820 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,821 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:33,822 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,824 INFO L388 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 12 [2021-06-05 21:52:33,825 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:33,852 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 21:52:33,853 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:52:33,853 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:33,853 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 21:52:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:33,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523404425] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:33,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:33,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:52:33,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295953596] [2021-06-05 21:52:33,891 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:33,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:33,892 INFO L87 Difference]: Start difference. First operand 1037 states and 4091 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:34,512 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2021-06-05 21:52:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:34,935 INFO L93 Difference]: Finished difference Result 1732 states and 6384 transitions. [2021-06-05 21:52:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 21:52:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:34,938 INFO L225 Difference]: With dead ends: 1732 [2021-06-05 21:52:34,938 INFO L226 Difference]: Without dead ends: 1643 [2021-06-05 21:52:34,938 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 883.9ms TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 21:52:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2021-06-05 21:52:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1066. [2021-06-05 21:52:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 4.016901408450704) internal successors, (4278), 1065 states have internal predecessors, (4278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 4278 transitions. [2021-06-05 21:52:34,954 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 4278 transitions. Word has length 18 [2021-06-05 21:52:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:34,954 INFO L482 AbstractCegarLoop]: Abstraction has 1066 states and 4278 transitions. [2021-06-05 21:52:34,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 4278 transitions. [2021-06-05 21:52:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:34,956 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:34,956 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:35,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 396 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4761 [2021-06-05 21:52:35,156 INFO L430 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:35,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash -614645920, now seen corresponding path program 250 times [2021-06-05 21:52:35,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:35,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238571512] [2021-06-05 21:52:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:35,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:35,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238571512] [2021-06-05 21:52:35,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238571512] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:35,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113758113] [2021-06-05 21:52:35,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:35,232 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:52:35,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:35,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:52:35,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:35,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,315 INFO L388 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 11 [2021-06-05 21:52:35,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,318 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,318 INFO L388 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 12 [2021-06-05 21:52:35,319 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,322 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:35,323 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,338 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:35,339 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:35,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:35,380 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 21:52:35,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,453 INFO L388 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 12 [2021-06-05 21:52:35,454 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,457 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:35,458 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,461 INFO L388 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 11 [2021-06-05 21:52:35,462 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,465 INFO L388 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 19 treesize of output 15 [2021-06-05 21:52:35,466 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,469 INFO L388 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 12 [2021-06-05 21:52:35,469 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,472 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:35,473 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,476 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:35,477 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,479 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:35,480 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:35,566 INFO L628 ElimStorePlain]: treesize reduction 106, result has 38.7 percent of original size [2021-06-05 21:52:35,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:35,568 INFO L388 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 10 treesize of output 6 [2021-06-05 21:52:35,570 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:35,572 INFO L388 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 10 treesize of output 6 [2021-06-05 21:52:35,573 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:35,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:35,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:35,599 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:253, output treesize:55 [2021-06-05 21:52:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:35,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113758113] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:35,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:35,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:52:35,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635139041] [2021-06-05 21:52:35,692 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:35,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:35,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:35,693 INFO L87 Difference]: Start difference. First operand 1066 states and 4278 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:37,088 INFO L93 Difference]: Finished difference Result 1823 states and 6671 transitions. [2021-06-05 21:52:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 21:52:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:37,092 INFO L225 Difference]: With dead ends: 1823 [2021-06-05 21:52:37,092 INFO L226 Difference]: Without dead ends: 1753 [2021-06-05 21:52:37,092 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1174.3ms TimeCoverageRelationStatistics Valid=339, Invalid=1467, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 21:52:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2021-06-05 21:52:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 965. [2021-06-05 21:52:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 3.9325726141078836) internal successors, (3791), 964 states have internal predecessors, (3791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 3791 transitions. [2021-06-05 21:52:37,108 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 3791 transitions. Word has length 18 [2021-06-05 21:52:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:37,108 INFO L482 AbstractCegarLoop]: Abstraction has 965 states and 3791 transitions. [2021-06-05 21:52:37,108 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 3791 transitions. [2021-06-05 21:52:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:37,109 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:37,109 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:37,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4773,397 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:37,310 INFO L430 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1844903270, now seen corresponding path program 251 times [2021-06-05 21:52:37,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:37,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876045568] [2021-06-05 21:52:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:37,708 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:37,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876045568] [2021-06-05 21:52:37,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876045568] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:37,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250351406] [2021-06-05 21:52:37,708 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:37,737 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:52:37,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:37,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:37,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:37,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:37,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:37,915 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:37,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:37,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:37,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:37,920 INFO L388 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 35 treesize of output 27 [2021-06-05 21:52:37,921 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:37,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:37,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:37,925 INFO L388 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 11 [2021-06-05 21:52:37,926 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:37,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:37,929 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:37,930 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:37,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:37,987 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:52:37,987 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:181, output treesize:151 [2021-06-05 21:52:38,112 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 21:52:38,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,117 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:38,118 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:38,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,123 INFO L388 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 29 treesize of output 23 [2021-06-05 21:52:38,124 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:38,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,128 INFO L388 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 30 treesize of output 24 [2021-06-05 21:52:38,129 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:38,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,133 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:38,134 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:38,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,139 INFO L388 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 12 [2021-06-05 21:52:38,139 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:38,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,143 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:38,144 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:38,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,149 INFO L388 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 11 [2021-06-05 21:52:38,150 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:38,153 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:38,154 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:38,304 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 21:52:38,305 INFO L628 ElimStorePlain]: treesize reduction 138, result has 52.9 percent of original size [2021-06-05 21:52:38,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,309 INFO L388 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 [2021-06-05 21:52:38,310 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:38,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,315 INFO L388 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 10 treesize of output 6 [2021-06-05 21:52:38,316 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:38,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:38,319 INFO L388 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 12 treesize of output 8 [2021-06-05 21:52:38,321 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:38,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:38,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:52:38,382 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:373, output treesize:97 [2021-06-05 21:52:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:38,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250351406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:38,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:38,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 21:52:38,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912417056] [2021-06-05 21:52:38,535 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:52:38,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:52:38,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:52:38,535 INFO L87 Difference]: Start difference. First operand 965 states and 3791 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:39,286 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2021-06-05 21:52:39,428 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 21:52:39,679 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2021-06-05 21:52:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:40,150 INFO L93 Difference]: Finished difference Result 1236 states and 4759 transitions. [2021-06-05 21:52:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:52:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:40,152 INFO L225 Difference]: With dead ends: 1236 [2021-06-05 21:52:40,152 INFO L226 Difference]: Without dead ends: 1231 [2021-06-05 21:52:40,152 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1657.9ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:52:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2021-06-05 21:52:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 969. [2021-06-05 21:52:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 3.9328512396694215) internal successors, (3807), 968 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 3807 transitions. [2021-06-05 21:52:40,164 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 3807 transitions. Word has length 18 [2021-06-05 21:52:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:40,164 INFO L482 AbstractCegarLoop]: Abstraction has 969 states and 3807 transitions. [2021-06-05 21:52:40,164 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 3807 transitions. [2021-06-05 21:52:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:40,165 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:40,165 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:40,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4786,398 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:40,365 INFO L430 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:40,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1839906778, now seen corresponding path program 252 times [2021-06-05 21:52:40,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:40,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499528305] [2021-06-05 21:52:40,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:40,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:40,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499528305] [2021-06-05 21:52:40,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499528305] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:40,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244264801] [2021-06-05 21:52:40,743 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:40,771 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:52:40,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:40,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:40,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:41,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,057 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:41,058 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,062 INFO L388 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 11 [2021-06-05 21:52:41,062 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:41,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,130 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:41,131 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,135 INFO L388 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 27 treesize of output 21 [2021-06-05 21:52:41,136 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:41,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,198 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:41,198 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,202 INFO L388 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 11 [2021-06-05 21:52:41,203 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,255 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:41,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 21:52:41,259 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:200, output treesize:150 [2021-06-05 21:52:41,411 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 21=[array_0]} [2021-06-05 21:52:41,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,416 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:41,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,421 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:41,422 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,427 INFO L388 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 19 treesize of output 15 [2021-06-05 21:52:41,427 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,432 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:41,433 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,438 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:41,438 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,443 INFO L388 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 11 [2021-06-05 21:52:41,444 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,448 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:41,449 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,454 INFO L388 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 11 [2021-06-05 21:52:41,455 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,459 INFO L388 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 20 treesize of output 16 [2021-06-05 21:52:41,460 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,464 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:41,465 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,470 INFO L388 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 12 [2021-06-05 21:52:41,471 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,475 INFO L388 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 12 [2021-06-05 21:52:41,475 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:41,654 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 21:52:41,655 INFO L628 ElimStorePlain]: treesize reduction 138, result has 56.9 percent of original size [2021-06-05 21:52:41,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,659 INFO L388 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 9 treesize of output 5 [2021-06-05 21:52:41,661 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:41,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,665 INFO L388 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 13 treesize of output 9 [2021-06-05 21:52:41,666 INFO L550 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:41,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,671 INFO L388 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 10 treesize of output 6 [2021-06-05 21:52:41,672 INFO L550 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:41,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,676 INFO L388 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 10 treesize of output 6 [2021-06-05 21:52:41,678 INFO L550 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:41,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:41,682 INFO L388 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 [2021-06-05 21:52:41,683 INFO L550 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:41,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:41,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2021-06-05 21:52:41,756 INFO L247 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:407, output treesize:99 [2021-06-05 21:52:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:41,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244264801] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:41,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:41,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 21:52:41,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44634248] [2021-06-05 21:52:41,887 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:52:41,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:52:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:52:41,888 INFO L87 Difference]: Start difference. First operand 969 states and 3807 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:42,321 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2021-06-05 21:52:42,591 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 123 [2021-06-05 21:52:42,804 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2021-06-05 21:52:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:42,996 INFO L93 Difference]: Finished difference Result 1200 states and 4678 transitions. [2021-06-05 21:52:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:42,998 INFO L225 Difference]: With dead ends: 1200 [2021-06-05 21:52:42,998 INFO L226 Difference]: Without dead ends: 1193 [2021-06-05 21:52:42,999 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1432.8ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:52:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2021-06-05 21:52:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 970. [2021-06-05 21:52:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9308565531475748) internal successors, (3809), 969 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3809 transitions. [2021-06-05 21:52:43,010 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3809 transitions. Word has length 18 [2021-06-05 21:52:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:43,010 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3809 transitions. [2021-06-05 21:52:43,010 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3809 transitions. [2021-06-05 21:52:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:43,011 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:43,011 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:43,212 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 399 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4810 [2021-06-05 21:52:43,212 INFO L430 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1410858674, now seen corresponding path program 253 times [2021-06-05 21:52:43,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:43,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688493605] [2021-06-05 21:52:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:43,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:43,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688493605] [2021-06-05 21:52:43,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688493605] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:43,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516497560] [2021-06-05 21:52:43,841 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:43,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:52:43,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:44,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,022 INFO L388 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 35 treesize of output 27 [2021-06-05 21:52:44,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,026 INFO L388 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 11 [2021-06-05 21:52:44,027 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,030 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:44,031 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,033 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:44,034 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:44,089 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:44,089 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:125 [2021-06-05 21:52:44,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,179 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:44,179 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,183 INFO L388 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 11 [2021-06-05 21:52:44,183 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,187 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:44,188 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,191 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:44,192 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,196 INFO L388 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 29 treesize of output 23 [2021-06-05 21:52:44,196 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,200 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:44,201 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,204 INFO L388 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 12 [2021-06-05 21:52:44,205 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,207 INFO L388 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 30 treesize of output 24 [2021-06-05 21:52:44,208 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:44,329 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2021-06-05 21:52:44,330 INFO L628 ElimStorePlain]: treesize reduction 125, result has 52.1 percent of original size [2021-06-05 21:52:44,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,333 INFO L388 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 12 treesize of output 8 [2021-06-05 21:52:44,334 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:44,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:44,337 INFO L388 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 12 treesize of output 8 [2021-06-05 21:52:44,338 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:44,341 INFO L388 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 [2021-06-05 21:52:44,342 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:44,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:44,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:52:44,395 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:321, output treesize:112 [2021-06-05 21:52:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:44,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516497560] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:44,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:44,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:52:44,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853388976] [2021-06-05 21:52:44,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:52:44,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:44,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:52:44,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:52:44,611 INFO L87 Difference]: Start difference. First operand 970 states and 3809 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:45,363 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2021-06-05 21:52:45,610 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2021-06-05 21:52:45,983 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 91 [2021-06-05 21:52:46,133 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2021-06-05 21:52:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:46,274 INFO L93 Difference]: Finished difference Result 1213 states and 4699 transitions. [2021-06-05 21:52:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:52:46,274 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:46,276 INFO L225 Difference]: With dead ends: 1213 [2021-06-05 21:52:46,276 INFO L226 Difference]: Without dead ends: 1202 [2021-06-05 21:52:46,276 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2172.8ms TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:52:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-06-05 21:52:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 972. [2021-06-05 21:52:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.927909371781668) internal successors, (3814), 971 states have internal predecessors, (3814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3814 transitions. [2021-06-05 21:52:46,294 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3814 transitions. Word has length 18 [2021-06-05 21:52:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:46,295 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3814 transitions. [2021-06-05 21:52:46,295 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3814 transitions. [2021-06-05 21:52:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:46,296 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:46,296 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:46,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4844,400 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:46,496 INFO L430 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1470869184, now seen corresponding path program 254 times [2021-06-05 21:52:46,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:46,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231344703] [2021-06-05 21:52:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:46,960 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2021-06-05 21:52:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:47,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:47,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231344703] [2021-06-05 21:52:47,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231344703] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:47,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318058149] [2021-06-05 21:52:47,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:47,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:52:47,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:47,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 21:52:47,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:47,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,394 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:47,395 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,399 INFO L388 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 11 [2021-06-05 21:52:47,399 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,403 INFO L388 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 35 treesize of output 27 [2021-06-05 21:52:47,403 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,406 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:47,407 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,465 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:47,466 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:47,467 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:181, output treesize:147 [2021-06-05 21:52:47,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,570 INFO L388 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 12 [2021-06-05 21:52:47,571 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,575 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:47,575 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,579 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:47,580 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,583 INFO L388 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 30 treesize of output 24 [2021-06-05 21:52:47,584 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,588 INFO L388 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 29 treesize of output 23 [2021-06-05 21:52:47,589 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,592 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:47,593 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,596 INFO L388 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 11 [2021-06-05 21:52:47,597 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,600 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:47,601 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,756 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2021-06-05 21:52:47,756 INFO L628 ElimStorePlain]: treesize reduction 131, result has 56.2 percent of original size [2021-06-05 21:52:47,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,759 INFO L388 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 10 treesize of output 6 [2021-06-05 21:52:47,761 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:47,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,764 INFO L388 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 22 treesize of output 14 [2021-06-05 21:52:47,765 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:47,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:47,768 INFO L388 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 10 treesize of output 6 [2021-06-05 21:52:47,769 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:47,772 INFO L388 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 12 treesize of output 8 [2021-06-05 21:52:47,773 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:47,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:47,840 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:52:47,841 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:365, output treesize:134 [2021-06-05 21:52:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:48,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318058149] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:48,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:48,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 21:52:48,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195636182] [2021-06-05 21:52:48,118 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 21:52:48,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 21:52:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:52:48,118 INFO L87 Difference]: Start difference. First operand 972 states and 3814 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:48,403 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-06-05 21:52:48,710 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2021-06-05 21:52:49,001 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2021-06-05 21:52:49,612 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2021-06-05 21:52:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:49,955 INFO L93 Difference]: Finished difference Result 1232 states and 4740 transitions. [2021-06-05 21:52:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:52:49,956 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:49,958 INFO L225 Difference]: With dead ends: 1232 [2021-06-05 21:52:49,958 INFO L226 Difference]: Without dead ends: 1218 [2021-06-05 21:52:49,958 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2358.3ms TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:52:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2021-06-05 21:52:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 971. [2021-06-05 21:52:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 3.9278350515463916) internal successors, (3810), 970 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 3810 transitions. [2021-06-05 21:52:49,969 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 3810 transitions. Word has length 18 [2021-06-05 21:52:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:49,969 INFO L482 AbstractCegarLoop]: Abstraction has 971 states and 3810 transitions. [2021-06-05 21:52:49,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 3810 transitions. [2021-06-05 21:52:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:49,971 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:49,971 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:50,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4861,401 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:50,171 INFO L430 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:50,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1377259446, now seen corresponding path program 255 times [2021-06-05 21:52:50,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:50,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247823546] [2021-06-05 21:52:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:50,450 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 44 [2021-06-05 21:52:50,609 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2021-06-05 21:52:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:50,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:50,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247823546] [2021-06-05 21:52:50,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247823546] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:50,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468077664] [2021-06-05 21:52:50,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:51,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:52:51,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:51,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:51,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:51,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,171 INFO L388 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 11 [2021-06-05 21:52:51,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,174 INFO L388 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 35 treesize of output 27 [2021-06-05 21:52:51,175 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,178 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:51,179 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,182 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:51,183 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:51,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:52:51,223 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:117 [2021-06-05 21:52:51,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,401 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:51,401 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,405 INFO L388 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 12 [2021-06-05 21:52:51,405 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,408 INFO L388 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 30 treesize of output 24 [2021-06-05 21:52:51,409 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,413 INFO L388 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 12 [2021-06-05 21:52:51,413 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,417 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:51,417 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,421 INFO L388 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 11 [2021-06-05 21:52:51,421 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,425 INFO L388 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 29 treesize of output 23 [2021-06-05 21:52:51,426 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,429 INFO L388 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 11 [2021-06-05 21:52:51,429 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,433 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:51,433 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,436 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:51,437 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,440 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:51,441 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,444 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:51,444 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,514 INFO L628 ElimStorePlain]: treesize reduction 137, result has 37.4 percent of original size [2021-06-05 21:52:51,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:51,517 INFO L388 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 12 treesize of output 8 [2021-06-05 21:52:51,518 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:51,521 INFO L388 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 22 treesize of output 14 [2021-06-05 21:52:51,521 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:51,545 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:51,546 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:52:51,546 INFO L247 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:355, output treesize:60 [2021-06-05 21:52:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:51,636 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468077664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:51,636 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:51,636 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:52:51,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194549132] [2021-06-05 21:52:51,636 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:52:51,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:51,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:52:51,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:52:51,636 INFO L87 Difference]: Start difference. First operand 971 states and 3810 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:52,145 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2021-06-05 21:52:52,667 WARN L205 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 101 [2021-06-05 21:52:52,852 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-06-05 21:52:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:53,005 INFO L93 Difference]: Finished difference Result 1203 states and 4681 transitions. [2021-06-05 21:52:53,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:53,006 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:53,007 INFO L225 Difference]: With dead ends: 1203 [2021-06-05 21:52:53,007 INFO L226 Difference]: Without dead ends: 1196 [2021-06-05 21:52:53,008 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2061.3ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:52:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2021-06-05 21:52:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 970. [2021-06-05 21:52:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.928792569659443) internal successors, (3807), 969 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3807 transitions. [2021-06-05 21:52:53,019 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3807 transitions. Word has length 18 [2021-06-05 21:52:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:53,019 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3807 transitions. [2021-06-05 21:52:53,019 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3807 transitions. [2021-06-05 21:52:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:53,020 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:53,021 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:53,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4877,402 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:53,221 INFO L430 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1371125786, now seen corresponding path program 256 times [2021-06-05 21:52:53,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:53,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202405615] [2021-06-05 21:52:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:53,836 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:53,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202405615] [2021-06-05 21:52:53,836 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202405615] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:53,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637461755] [2021-06-05 21:52:53,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:53,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:52:53,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:53,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:53,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:54,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:52:54,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:52:54,077 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:52:54,081 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:52:54,084 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:54,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:52:54,126 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:52:54,129 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:54,163 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 21:52:54,163 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:164, output treesize:124 [2021-06-05 21:52:54,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,244 INFO L388 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 12 [2021-06-05 21:52:54,245 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,248 INFO L388 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 30 treesize of output 24 [2021-06-05 21:52:54,249 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,252 INFO L388 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 12 [2021-06-05 21:52:54,253 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,256 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:54,257 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,261 INFO L388 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 11 [2021-06-05 21:52:54,261 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,265 INFO L388 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 29 treesize of output 23 [2021-06-05 21:52:54,265 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,269 INFO L388 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 11 [2021-06-05 21:52:54,269 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,273 INFO L388 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 18 treesize of output 14 [2021-06-05 21:52:54,273 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,276 INFO L388 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 26 treesize of output 20 [2021-06-05 21:52:54,277 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,280 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:52:54,281 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,284 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:54,285 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,287 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:54,288 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,358 INFO L628 ElimStorePlain]: treesize reduction 158, result has 33.3 percent of original size [2021-06-05 21:52:54,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:54,361 INFO L388 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 22 treesize of output 14 [2021-06-05 21:52:54,362 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:54,364 INFO L388 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 12 treesize of output 8 [2021-06-05 21:52:54,366 INFO L550 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:54,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:54,390 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 21:52:54,390 INFO L247 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:355, output treesize:57 [2021-06-05 21:52:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:54,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637461755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:54,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:54,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:52:54,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78409496] [2021-06-05 21:52:54,478 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:52:54,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:52:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:52:54,479 INFO L87 Difference]: Start difference. First operand 970 states and 3807 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:54,911 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2021-06-05 21:52:55,120 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 71 [2021-06-05 21:52:55,380 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2021-06-05 21:52:55,549 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2021-06-05 21:52:55,715 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-06-05 21:52:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:55,860 INFO L93 Difference]: Finished difference Result 1215 states and 4699 transitions. [2021-06-05 21:52:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:52:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:55,862 INFO L225 Difference]: With dead ends: 1215 [2021-06-05 21:52:55,862 INFO L226 Difference]: Without dead ends: 1203 [2021-06-05 21:52:55,862 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1852.2ms TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:52:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-06-05 21:52:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 968. [2021-06-05 21:52:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 3.9317476732161323) internal successors, (3802), 967 states have internal predecessors, (3802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 3802 transitions. [2021-06-05 21:52:55,873 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 3802 transitions. Word has length 18 [2021-06-05 21:52:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:55,873 INFO L482 AbstractCegarLoop]: Abstraction has 968 states and 3802 transitions. [2021-06-05 21:52:55,874 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 3802 transitions. [2021-06-05 21:52:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:55,875 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:55,875 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:56,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 403 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4893 [2021-06-05 21:52:56,075 INFO L430 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1768721062, now seen corresponding path program 257 times [2021-06-05 21:52:56,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:56,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648004724] [2021-06-05 21:52:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:56,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:56,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648004724] [2021-06-05 21:52:56,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648004724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:56,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201927251] [2021-06-05 21:52:56,284 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:56,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:52:56,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:56,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:56,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:56,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:56,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:56,417 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:56,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:56,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:56,421 INFO L388 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 11 [2021-06-05 21:52:56,421 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:56,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:56,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:56,454 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:78 [2021-06-05 21:52:56,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:56,654 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:56,655 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:56,701 INFO L628 ElimStorePlain]: treesize reduction 66, result has 41.6 percent of original size [2021-06-05 21:52:56,702 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1061 vanished before elimination [2021-06-05 21:52:56,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:56,704 INFO L388 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 27 treesize of output 21 [2021-06-05 21:52:56,705 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:56,716 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:56,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:56,718 INFO L388 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 22 treesize of output 14 [2021-06-05 21:52:56,719 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:56,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:56,731 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:56,731 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:124, output treesize:16 [2021-06-05 21:52:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:56,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201927251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:56,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:56,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:52:56,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447167058] [2021-06-05 21:52:56,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:56,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:56,748 INFO L87 Difference]: Start difference. First operand 968 states and 3802 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:57,100 INFO L93 Difference]: Finished difference Result 1004 states and 3893 transitions. [2021-06-05 21:52:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:57,100 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:57,102 INFO L225 Difference]: With dead ends: 1004 [2021-06-05 21:52:57,102 INFO L226 Difference]: Without dead ends: 999 [2021-06-05 21:52:57,102 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 460.0ms TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:52:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-06-05 21:52:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 976. [2021-06-05 21:52:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 3.927179487179487) internal successors, (3829), 975 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 3829 transitions. [2021-06-05 21:52:57,112 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 3829 transitions. Word has length 18 [2021-06-05 21:52:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:57,112 INFO L482 AbstractCegarLoop]: Abstraction has 976 states and 3829 transitions. [2021-06-05 21:52:57,112 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 3829 transitions. [2021-06-05 21:52:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:57,113 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:57,113 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:57,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 404 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4917 [2021-06-05 21:52:57,314 INFO L430 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash -171267684, now seen corresponding path program 258 times [2021-06-05 21:52:57,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:57,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094944639] [2021-06-05 21:52:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:57,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:57,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094944639] [2021-06-05 21:52:57,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094944639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:57,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870388742] [2021-06-05 21:52:57,508 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:57,535 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:52:57,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:52:57,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:57,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:57,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:57,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:57,637 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:57,638 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:57,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:57,640 INFO L388 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 11 [2021-06-05 21:52:57,641 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:57,671 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:57,672 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:57,672 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:74 [2021-06-05 21:52:57,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:57,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:57,754 INFO L388 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 11 [2021-06-05 21:52:57,755 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:57,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:57,758 INFO L388 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 17 treesize of output 13 [2021-06-05 21:52:57,759 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:57,827 INFO L628 ElimStorePlain]: treesize reduction 102, result has 41.0 percent of original size [2021-06-05 21:52:57,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:57,830 INFO L388 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 19 treesize of output 15 [2021-06-05 21:52:57,830 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:57,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:57,855 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1063 vanished before elimination [2021-06-05 21:52:57,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:57,858 INFO L388 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 [2021-06-05 21:52:57,860 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:52:57,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:57,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:57,886 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:185, output treesize:44 [2021-06-05 21:52:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:57,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870388742] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:57,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:57,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:52:57,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711983538] [2021-06-05 21:52:57,948 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:52:57,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:52:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:52:57,948 INFO L87 Difference]: Start difference. First operand 976 states and 3829 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:58,237 INFO L93 Difference]: Finished difference Result 1014 states and 3925 transitions. [2021-06-05 21:52:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:58,238 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:58,239 INFO L225 Difference]: With dead ends: 1014 [2021-06-05 21:52:58,239 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 21:52:58,239 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 407.6ms TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:52:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 21:52:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 973. [2021-06-05 21:52:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 3.9269547325102883) internal successors, (3817), 972 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 3817 transitions. [2021-06-05 21:52:58,250 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 3817 transitions. Word has length 18 [2021-06-05 21:52:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:58,250 INFO L482 AbstractCegarLoop]: Abstraction has 973 states and 3817 transitions. [2021-06-05 21:52:58,250 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 3817 transitions. [2021-06-05 21:52:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:58,251 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:58,251 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:58,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4941,405 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:58,451 INFO L430 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1045008364, now seen corresponding path program 259 times [2021-06-05 21:52:58,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:58,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343851360] [2021-06-05 21:52:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:58,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:52:58,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343851360] [2021-06-05 21:52:58,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343851360] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:58,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735392877] [2021-06-05 21:52:58,682 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:52:58,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:52:58,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:52:58,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:52:58,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:58,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:52:58,828 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:58,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:58,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:58,845 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 21:52:58,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:58,895 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:58,896 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:58,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:58,899 INFO L388 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 35 treesize of output 27 [2021-06-05 21:52:58,900 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:58,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:52:58,902 INFO L388 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 11 [2021-06-05 21:52:58,903 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:58,905 INFO L388 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 25 treesize of output 19 [2021-06-05 21:52:58,906 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:58,945 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 21:52:58,947 INFO L388 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 22 treesize of output 14 [2021-06-05 21:52:58,948 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:52:58,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:52:58,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:52:58,963 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:52:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:52:59,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735392877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:52:59,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:52:59,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:52:59,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712656417] [2021-06-05 21:52:59,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:52:59,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:52:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:52:59,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:52:59,027 INFO L87 Difference]: Start difference. First operand 973 states and 3817 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:52:59,738 INFO L93 Difference]: Finished difference Result 1009 states and 3915 transitions. [2021-06-05 21:52:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:52:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:52:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:52:59,740 INFO L225 Difference]: With dead ends: 1009 [2021-06-05 21:52:59,740 INFO L226 Difference]: Without dead ends: 1004 [2021-06-05 21:52:59,740 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 752.1ms TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:52:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-06-05 21:52:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 970. [2021-06-05 21:52:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9298245614035086) internal successors, (3808), 969 states have internal predecessors, (3808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3808 transitions. [2021-06-05 21:52:59,750 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3808 transitions. Word has length 18 [2021-06-05 21:52:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:52:59,750 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3808 transitions. [2021-06-05 21:52:59,751 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:52:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3808 transitions. [2021-06-05 21:52:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:52:59,752 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:52:59,752 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:52:59,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4952,406 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:52:59,952 INFO L430 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:52:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:52:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash -496091954, now seen corresponding path program 260 times [2021-06-05 21:52:59,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:52:59,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302263743] [2021-06-05 21:52:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:52:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:00,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:00,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302263743] [2021-06-05 21:53:00,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302263743] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:00,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713457702] [2021-06-05 21:53:00,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:00,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:53:00,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:00,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:00,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:00,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:00,378 INFO L388 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 12 [2021-06-05 21:53:00,379 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:00,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:00,382 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:00,383 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:00,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:00,386 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:00,387 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:00,390 INFO L388 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 11 [2021-06-05 21:53:00,391 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:00,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:00,440 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:00,440 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:53:00,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:53:00,646 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:00,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:00,654 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:00,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:00,655 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:53:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:00,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713457702] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:00,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:00,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:53:00,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465019283] [2021-06-05 21:53:00,692 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:53:00,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:53:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:00,693 INFO L87 Difference]: Start difference. First operand 970 states and 3808 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:01,187 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 21:53:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:01,537 INFO L93 Difference]: Finished difference Result 1010 states and 3910 transitions. [2021-06-05 21:53:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:01,537 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:01,539 INFO L225 Difference]: With dead ends: 1010 [2021-06-05 21:53:01,539 INFO L226 Difference]: Without dead ends: 1005 [2021-06-05 21:53:01,539 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1075.3ms TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:53:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2021-06-05 21:53:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 977. [2021-06-05 21:53:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.930327868852459) internal successors, (3836), 976 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3836 transitions. [2021-06-05 21:53:01,549 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3836 transitions. Word has length 18 [2021-06-05 21:53:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:01,549 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3836 transitions. [2021-06-05 21:53:01,549 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3836 transitions. [2021-06-05 21:53:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:01,550 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:01,550 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:01,751 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 407 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4962 [2021-06-05 21:53:01,751 INFO L430 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1858886596, now seen corresponding path program 261 times [2021-06-05 21:53:01,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:01,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849238358] [2021-06-05 21:53:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:02,053 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:02,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849238358] [2021-06-05 21:53:02,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849238358] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:02,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133050740] [2021-06-05 21:53:02,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:02,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:53:02,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:02,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:02,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:02,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,190 INFO L388 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 12 [2021-06-05 21:53:02,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,195 INFO L388 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 11 [2021-06-05 21:53:02,195 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,199 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:02,200 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,203 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:02,204 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:02,264 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:53:02,265 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:191, output treesize:159 [2021-06-05 21:53:02,458 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 3=[array_4]} [2021-06-05 21:53:02,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,462 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:02,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,467 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:02,468 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,471 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:02,472 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,476 INFO L388 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 11 [2021-06-05 21:53:02,476 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,538 INFO L628 ElimStorePlain]: treesize reduction 89, result has 44.0 percent of original size [2021-06-05 21:53:02,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:02,541 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:02,542 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:02,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:02,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:02,567 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:193, output treesize:44 [2021-06-05 21:53:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:02,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133050740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:02,643 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:02,643 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:53:02,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945377354] [2021-06-05 21:53:02,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:53:02,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:53:02,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:53:02,644 INFO L87 Difference]: Start difference. First operand 977 states and 3836 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:03,045 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2021-06-05 21:53:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:03,341 INFO L93 Difference]: Finished difference Result 1026 states and 3966 transitions. [2021-06-05 21:53:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:03,341 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:03,343 INFO L225 Difference]: With dead ends: 1026 [2021-06-05 21:53:03,343 INFO L226 Difference]: Without dead ends: 1021 [2021-06-05 21:53:03,343 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 868.1ms TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:53:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-06-05 21:53:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 970. [2021-06-05 21:53:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9298245614035086) internal successors, (3808), 969 states have internal predecessors, (3808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3808 transitions. [2021-06-05 21:53:03,353 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3808 transitions. Word has length 18 [2021-06-05 21:53:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:03,354 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3808 transitions. [2021-06-05 21:53:03,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3808 transitions. [2021-06-05 21:53:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:03,355 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:03,355 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:03,555 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4976,408 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:03,555 INFO L430 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:03,555 INFO L82 PathProgramCache]: Analyzing trace with hash -288998972, now seen corresponding path program 262 times [2021-06-05 21:53:03,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:03,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282029804] [2021-06-05 21:53:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:03,831 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:03,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282029804] [2021-06-05 21:53:03,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282029804] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:03,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019472571] [2021-06-05 21:53:03,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:03,859 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:53:03,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:03,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:53:03,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:03,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:03,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:03,940 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:03,941 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:03,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:03,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:03,945 INFO L388 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 12 [2021-06-05 21:53:03,946 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:03,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:03,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:03,950 INFO L388 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 11 [2021-06-05 21:53:03,951 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:03,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:03,955 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:03,956 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:04,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:04,024 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:04,024 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:161 [2021-06-05 21:53:04,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:04,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:04,189 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:04,190 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:04,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:04,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:04,194 INFO L388 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 17 treesize of output 13 [2021-06-05 21:53:04,195 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:04,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:04,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:04,198 INFO L388 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 27 treesize of output 21 [2021-06-05 21:53:04,199 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:04,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:04,202 INFO L388 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 11 [2021-06-05 21:53:04,203 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:04,280 INFO L628 ElimStorePlain]: treesize reduction 97, result has 43.9 percent of original size [2021-06-05 21:53:04,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:04,283 INFO L388 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 [2021-06-05 21:53:04,284 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:04,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:04,318 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:04,319 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:209, output treesize:68 [2021-06-05 21:53:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:04,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019472571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:04,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:04,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 21:53:04,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749378733] [2021-06-05 21:53:04,475 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:04,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:04,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:04,475 INFO L87 Difference]: Start difference. First operand 970 states and 3808 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:04,762 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2021-06-05 21:53:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:04,969 INFO L93 Difference]: Finished difference Result 1014 states and 3928 transitions. [2021-06-05 21:53:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:04,970 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:04,971 INFO L225 Difference]: With dead ends: 1014 [2021-06-05 21:53:04,972 INFO L226 Difference]: Without dead ends: 1001 [2021-06-05 21:53:04,972 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 803.6ms TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:53:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-06-05 21:53:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 969. [2021-06-05 21:53:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 3.9307851239669422) internal successors, (3805), 968 states have internal predecessors, (3805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 3805 transitions. [2021-06-05 21:53:04,982 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 3805 transitions. Word has length 18 [2021-06-05 21:53:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:04,982 INFO L482 AbstractCegarLoop]: Abstraction has 969 states and 3805 transitions. [2021-06-05 21:53:04,982 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 3805 transitions. [2021-06-05 21:53:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:04,984 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:04,984 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:05,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 409 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5003 [2021-06-05 21:53:05,184 INFO L430 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash -938991094, now seen corresponding path program 263 times [2021-06-05 21:53:05,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:05,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347755012] [2021-06-05 21:53:05,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:05,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:05,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347755012] [2021-06-05 21:53:05,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347755012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:05,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183362254] [2021-06-05 21:53:05,589 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:05,618 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:53:05,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:05,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 21:53:05,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:05,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:05,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:05,919 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 21:53:05,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 21:53:05,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:05,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:05,926 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:53:05,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 21:53:05,927 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:05,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:05,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:05,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:05,979 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 21:53:05,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 36 [2021-06-05 21:53:05,981 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:05,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:05,986 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 21:53:05,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 21:53:05,987 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:06,039 INFO L628 ElimStorePlain]: treesize reduction 31, result has 72.1 percent of original size [2021-06-05 21:53:06,041 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2021-06-05 21:53:06,042 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:175, output treesize:76 [2021-06-05 21:53:06,172 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1075, array_2], 1=[array_4, v_prenex_1076]} [2021-06-05 21:53:06,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:53:06,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:06,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:53:06,180 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:06,214 INFO L628 ElimStorePlain]: treesize reduction 62, result has 47.9 percent of original size [2021-06-05 21:53:06,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:53:06,218 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:06,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:06,230 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:06,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:06,232 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:06,233 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:06,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:06,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 21:53:06,246 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:131, output treesize:24 [2021-06-05 21:53:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:06,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183362254] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:06,282 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:06,282 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 21:53:06,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834194054] [2021-06-05 21:53:06,282 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:53:06,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:06,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:53:06,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:53:06,283 INFO L87 Difference]: Start difference. First operand 969 states and 3805 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:06,852 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2021-06-05 21:53:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:07,292 INFO L93 Difference]: Finished difference Result 1046 states and 4019 transitions. [2021-06-05 21:53:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:53:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:07,294 INFO L225 Difference]: With dead ends: 1046 [2021-06-05 21:53:07,294 INFO L226 Difference]: Without dead ends: 1036 [2021-06-05 21:53:07,294 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1217.1ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:53:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-06-05 21:53:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 970. [2021-06-05 21:53:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9308565531475748) internal successors, (3809), 969 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3809 transitions. [2021-06-05 21:53:07,305 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3809 transitions. Word has length 18 [2021-06-05 21:53:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:07,305 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3809 transitions. [2021-06-05 21:53:07,305 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3809 transitions. [2021-06-05 21:53:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:07,306 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:07,306 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:07,507 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 410 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5019 [2021-06-05 21:53:07,507 INFO L430 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:07,507 INFO L82 PathProgramCache]: Analyzing trace with hash -270512050, now seen corresponding path program 264 times [2021-06-05 21:53:07,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:07,507 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768616159] [2021-06-05 21:53:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:53:07,557 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:07,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768616159] [2021-06-05 21:53:07,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768616159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:07,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709110642] [2021-06-05 21:53:07,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:07,586 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:53:07,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:07,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 21:53:07,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:07,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:07,655 INFO L388 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 11 [2021-06-05 21:53:07,655 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:07,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:07,658 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:07,659 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:07,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:07,662 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:07,662 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:07,665 INFO L388 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 12 [2021-06-05 21:53:07,666 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:07,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:07,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:07,697 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 21:53:07,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:07,792 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:07,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:07,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:07,795 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:07,796 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:07,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:07,798 INFO L388 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 12 [2021-06-05 21:53:07,799 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:07,801 INFO L388 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 11 [2021-06-05 21:53:07,802 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:07,834 INFO L628 ElimStorePlain]: treesize reduction 60, result has 31.0 percent of original size [2021-06-05 21:53:07,834 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:07,835 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:07,835 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:27 [2021-06-05 21:53:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:07,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709110642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:07,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:07,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 21:53:07,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870306532] [2021-06-05 21:53:07,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:53:07,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:53:07,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:53:07,866 INFO L87 Difference]: Start difference. First operand 970 states and 3809 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:08,815 INFO L93 Difference]: Finished difference Result 1214 states and 4427 transitions. [2021-06-05 21:53:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 21:53:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:08,818 INFO L225 Difference]: With dead ends: 1214 [2021-06-05 21:53:08,818 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 21:53:08,818 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 832.1ms TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 21:53:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 21:53:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 970. [2021-06-05 21:53:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.937048503611971) internal successors, (3815), 969 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3815 transitions. [2021-06-05 21:53:08,830 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3815 transitions. Word has length 18 [2021-06-05 21:53:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:08,830 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3815 transitions. [2021-06-05 21:53:08,830 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3815 transitions. [2021-06-05 21:53:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:08,831 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:08,831 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:09,032 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5054,411 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:09,032 INFO L430 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1617696392, now seen corresponding path program 265 times [2021-06-05 21:53:09,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:09,032 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029280772] [2021-06-05 21:53:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:09,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:09,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029280772] [2021-06-05 21:53:09,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029280772] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:09,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844874407] [2021-06-05 21:53:09,795 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:09,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:09,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:09,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:09,940 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:09,941 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:09,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:09,944 INFO L388 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 12 [2021-06-05 21:53:09,945 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:09,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:09,948 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:09,949 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:09,952 INFO L388 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 11 [2021-06-05 21:53:09,952 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:09,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:09,997 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:09,998 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 21:53:10,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:10,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:10,138 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:10,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:10,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:10,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:10,142 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:10,143 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:10,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:10,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:10,147 INFO L388 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 11 [2021-06-05 21:53:10,147 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:10,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:10,150 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:10,151 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:10,200 INFO L628 ElimStorePlain]: treesize reduction 74, result has 42.6 percent of original size [2021-06-05 21:53:10,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:10,203 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:10,203 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:10,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:10,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:10,223 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:163, output treesize:41 [2021-06-05 21:53:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:10,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844874407] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:10,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:10,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2021-06-05 21:53:10,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445216059] [2021-06-05 21:53:10,303 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:53:10,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:10,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:53:10,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:53:10,303 INFO L87 Difference]: Start difference. First operand 970 states and 3815 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:10,815 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 21:53:11,067 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-06-05 21:53:11,381 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-06-05 21:53:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:11,434 INFO L93 Difference]: Finished difference Result 1006 states and 3914 transitions. [2021-06-05 21:53:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:11,435 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:11,436 INFO L225 Difference]: With dead ends: 1006 [2021-06-05 21:53:11,436 INFO L226 Difference]: Without dead ends: 1001 [2021-06-05 21:53:11,437 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1655.6ms TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:53:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-06-05 21:53:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 970. [2021-06-05 21:53:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.937048503611971) internal successors, (3815), 969 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3815 transitions. [2021-06-05 21:53:11,447 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3815 transitions. Word has length 18 [2021-06-05 21:53:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:11,447 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3815 transitions. [2021-06-05 21:53:11,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3815 transitions. [2021-06-05 21:53:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:11,448 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:11,448 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:11,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 412 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5065 [2021-06-05 21:53:11,648 INFO L430 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:11,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1666033298, now seen corresponding path program 266 times [2021-06-05 21:53:11,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:11,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186919366] [2021-06-05 21:53:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:11,827 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2021-06-05 21:53:12,049 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 21:53:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:12,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:12,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186919366] [2021-06-05 21:53:12,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186919366] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:12,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852304089] [2021-06-05 21:53:12,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:12,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:53:12,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:12,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:12,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:12,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:12,511 INFO L388 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 12 [2021-06-05 21:53:12,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:12,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:12,515 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:12,516 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:12,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:12,519 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:12,520 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:12,522 INFO L388 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 11 [2021-06-05 21:53:12,523 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:12,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:12,573 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:12,573 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:53:12,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:53:12,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:12,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:12,778 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:12,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:12,779 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 21:53:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:12,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852304089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:12,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:12,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:53:12,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308373364] [2021-06-05 21:53:12,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:53:12,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:12,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:53:12,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:53:12,822 INFO L87 Difference]: Start difference. First operand 970 states and 3815 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:13,206 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2021-06-05 21:53:13,467 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2021-06-05 21:53:13,695 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2021-06-05 21:53:13,983 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 62 [2021-06-05 21:53:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:14,140 INFO L93 Difference]: Finished difference Result 1055 states and 4054 transitions. [2021-06-05 21:53:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:53:14,141 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:14,143 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 21:53:14,143 INFO L226 Difference]: Without dead ends: 1045 [2021-06-05 21:53:14,143 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1795.4ms TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:53:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-06-05 21:53:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 973. [2021-06-05 21:53:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 3.9372427983539096) internal successors, (3827), 972 states have internal predecessors, (3827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 3827 transitions. [2021-06-05 21:53:14,154 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 3827 transitions. Word has length 18 [2021-06-05 21:53:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:14,154 INFO L482 AbstractCegarLoop]: Abstraction has 973 states and 3827 transitions. [2021-06-05 21:53:14,154 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 3827 transitions. [2021-06-05 21:53:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:14,156 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:14,156 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:14,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5080,413 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:14,356 INFO L430 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash -702614904, now seen corresponding path program 267 times [2021-06-05 21:53:14,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:14,356 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230622549] [2021-06-05 21:53:14,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:14,775 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:14,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230622549] [2021-06-05 21:53:14,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230622549] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:14,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966526634] [2021-06-05 21:53:14,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:14,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:53:14,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:14,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:14,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:14,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:14,926 INFO L388 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 12 [2021-06-05 21:53:14,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:14,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:14,931 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:14,932 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:14,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:14,935 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:14,936 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:14,939 INFO L388 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 11 [2021-06-05 21:53:14,939 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:14,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:14,998 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:14,998 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 21:53:15,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:15,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:15,163 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:15,164 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:15,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:15,167 INFO L388 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 27 treesize of output 21 [2021-06-05 21:53:15,168 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:15,226 INFO L628 ElimStorePlain]: treesize reduction 87, result has 41.6 percent of original size [2021-06-05 21:53:15,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:53:15,229 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:15,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:15,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:15,253 INFO L388 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 [2021-06-05 21:53:15,255 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:15,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:15,275 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1078 vanished before elimination [2021-06-05 21:53:15,277 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:15,277 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 21:53:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:15,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966526634] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:15,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:15,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:15,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132097121] [2021-06-05 21:53:15,342 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:15,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:15,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:15,343 INFO L87 Difference]: Start difference. First operand 973 states and 3827 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:15,820 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-05 21:53:15,989 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-06-05 21:53:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:16,341 INFO L93 Difference]: Finished difference Result 1040 states and 4021 transitions. [2021-06-05 21:53:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:53:16,342 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:16,343 INFO L225 Difference]: With dead ends: 1040 [2021-06-05 21:53:16,343 INFO L226 Difference]: Without dead ends: 1030 [2021-06-05 21:53:16,344 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1266.0ms TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:53:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2021-06-05 21:53:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 977. [2021-06-05 21:53:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 21:53:16,354 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 21:53:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:16,354 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 21:53:16,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 21:53:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:16,355 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:16,355 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:16,555 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 414 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5094 [2021-06-05 21:53:16,556 INFO L430 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:16,556 INFO L82 PathProgramCache]: Analyzing trace with hash -591633002, now seen corresponding path program 268 times [2021-06-05 21:53:16,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:16,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716224377] [2021-06-05 21:53:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:16,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:16,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716224377] [2021-06-05 21:53:16,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716224377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:16,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404301601] [2021-06-05 21:53:16,767 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:16,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:53:16,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:16,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:53:16,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:16,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:16,911 INFO L388 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 11 [2021-06-05 21:53:16,912 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:16,914 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:16,915 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:16,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:16,946 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:16,946 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 21:53:17,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:17,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:17,060 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:17,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:17,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:17,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:17,064 INFO L388 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 11 [2021-06-05 21:53:17,065 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:17,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:17,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:17,068 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:17,069 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:17,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:17,072 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:17,073 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:17,123 INFO L628 ElimStorePlain]: treesize reduction 83, result has 38.5 percent of original size [2021-06-05 21:53:17,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:17,125 INFO L388 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 [2021-06-05 21:53:17,127 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:17,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:17,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:17,147 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:169, output treesize:44 [2021-06-05 21:53:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:17,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404301601] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:17,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:17,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 21:53:17,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477677434] [2021-06-05 21:53:17,219 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:53:17,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:53:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:17,219 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:17,811 INFO L93 Difference]: Finished difference Result 1050 states and 4071 transitions. [2021-06-05 21:53:17,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:17,812 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:17,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:17,813 INFO L225 Difference]: With dead ends: 1050 [2021-06-05 21:53:17,814 INFO L226 Difference]: Without dead ends: 1037 [2021-06-05 21:53:17,814 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 642.3ms TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:53:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-06-05 21:53:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 983. [2021-06-05 21:53:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9297352342158858) internal successors, (3859), 982 states have internal predecessors, (3859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3859 transitions. [2021-06-05 21:53:17,824 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3859 transitions. Word has length 18 [2021-06-05 21:53:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:17,824 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3859 transitions. [2021-06-05 21:53:17,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3859 transitions. [2021-06-05 21:53:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:17,825 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:17,825 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:18,026 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 415 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5109 [2021-06-05 21:53:18,026 INFO L430 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1763345548, now seen corresponding path program 269 times [2021-06-05 21:53:18,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:18,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095236152] [2021-06-05 21:53:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:18,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:18,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095236152] [2021-06-05 21:53:18,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095236152] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:18,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87130506] [2021-06-05 21:53:18,252 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:18,281 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:53:18,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:18,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:18,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:18,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:18,383 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:18,383 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:18,386 INFO L388 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 11 [2021-06-05 21:53:18,387 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:18,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:18,414 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:18,414 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 21:53:18,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:18,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:18,532 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:18,532 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:18,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:18,536 INFO L388 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 11 [2021-06-05 21:53:18,536 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:18,598 INFO L628 ElimStorePlain]: treesize reduction 95, result has 41.0 percent of original size [2021-06-05 21:53:18,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:18,601 INFO L388 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 27 treesize of output 21 [2021-06-05 21:53:18,602 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:18,623 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:18,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:18,626 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:18,626 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:18,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:18,646 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1080 vanished before elimination [2021-06-05 21:53:18,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:18,648 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 21:53:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:18,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87130506] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:18,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:18,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:18,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185643987] [2021-06-05 21:53:18,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:18,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:18,713 INFO L87 Difference]: Start difference. First operand 983 states and 3859 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:19,239 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2021-06-05 21:53:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:19,497 INFO L93 Difference]: Finished difference Result 1052 states and 4088 transitions. [2021-06-05 21:53:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:19,499 INFO L225 Difference]: With dead ends: 1052 [2021-06-05 21:53:19,499 INFO L226 Difference]: Without dead ends: 1047 [2021-06-05 21:53:19,499 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 864.5ms TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:53:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2021-06-05 21:53:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 980. [2021-06-05 21:53:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 21:53:19,510 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 21:53:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:19,510 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 21:53:19,510 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 21:53:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:19,511 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:19,511 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:19,712 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5122,416 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:19,712 INFO L430 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash 889604868, now seen corresponding path program 270 times [2021-06-05 21:53:19,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:19,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607984999] [2021-06-05 21:53:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:19,971 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:19,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607984999] [2021-06-05 21:53:19,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607984999] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:19,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385463020] [2021-06-05 21:53:19,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:20,008 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:53:20,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:20,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:20,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:20,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:20,119 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:20,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:20,123 INFO L388 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 11 [2021-06-05 21:53:20,123 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:20,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:20,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:20,146 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 21:53:20,196 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1083], 1=[v_prenex_1084, array_4]} [2021-06-05 21:53:20,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:53:20,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:20,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:53:20,203 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:20,247 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.0 percent of original size [2021-06-05 21:53:20,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:53:20,250 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:20,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:20,268 INFO L388 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 [2021-06-05 21:53:20,269 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:20,284 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:20,284 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:20,285 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:20,285 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 21:53:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:20,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385463020] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:20,350 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:20,350 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:53:20,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140301395] [2021-06-05 21:53:20,350 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:53:20,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:53:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:20,350 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:21,114 INFO L93 Difference]: Finished difference Result 1068 states and 4122 transitions. [2021-06-05 21:53:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:21,116 INFO L225 Difference]: With dead ends: 1068 [2021-06-05 21:53:21,116 INFO L226 Difference]: Without dead ends: 1063 [2021-06-05 21:53:21,117 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 811.4ms TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:53:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-06-05 21:53:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 983. [2021-06-05 21:53:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9327902240325865) internal successors, (3862), 982 states have internal predecessors, (3862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3862 transitions. [2021-06-05 21:53:21,127 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3862 transitions. Word has length 18 [2021-06-05 21:53:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:21,127 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3862 transitions. [2021-06-05 21:53:21,127 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3862 transitions. [2021-06-05 21:53:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:21,128 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:21,128 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:21,328 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5147,417 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:21,329 INFO L430 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash -781371148, now seen corresponding path program 271 times [2021-06-05 21:53:21,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:21,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548828009] [2021-06-05 21:53:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:21,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:21,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548828009] [2021-06-05 21:53:21,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548828009] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:21,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244770195] [2021-06-05 21:53:21,566 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:21,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:53:21,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:21,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:21,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:21,703 INFO L388 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 11 [2021-06-05 21:53:21,704 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:21,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:21,707 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:21,708 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:21,739 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:21,740 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:21,740 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 21:53:21,909 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 21:53:21,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:21,913 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:21,914 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:21,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:21,917 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:21,918 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:21,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:21,921 INFO L388 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 11 [2021-06-05 21:53:21,922 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:21,925 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:21,926 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:21,985 INFO L628 ElimStorePlain]: treesize reduction 89, result has 39.5 percent of original size [2021-06-05 21:53:21,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:21,988 INFO L388 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 [2021-06-05 21:53:21,989 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:22,011 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:22,013 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:22,013 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:38 [2021-06-05 21:53:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:22,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244770195] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:22,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:22,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 21:53:22,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295927695] [2021-06-05 21:53:22,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:53:22,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:53:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:22,087 INFO L87 Difference]: Start difference. First operand 983 states and 3862 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:22,602 INFO L93 Difference]: Finished difference Result 1051 states and 4076 transitions. [2021-06-05 21:53:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:22,604 INFO L225 Difference]: With dead ends: 1051 [2021-06-05 21:53:22,604 INFO L226 Difference]: Without dead ends: 1040 [2021-06-05 21:53:22,604 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 639.3ms TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:53:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-06-05 21:53:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 977. [2021-06-05 21:53:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 21:53:22,614 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 21:53:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:22,614 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 21:53:22,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 21:53:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:22,615 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:22,615 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:22,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5158,418 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:22,816 INFO L430 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash 318150062, now seen corresponding path program 272 times [2021-06-05 21:53:22,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:22,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606358963] [2021-06-05 21:53:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:23,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:23,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606358963] [2021-06-05 21:53:23,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606358963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:23,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143827887] [2021-06-05 21:53:23,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:23,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:53:23,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:23,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:23,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:23,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:23,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:23,135 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:23,135 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:23,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:23,138 INFO L388 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 11 [2021-06-05 21:53:23,139 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:23,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:23,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:23,162 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:55 [2021-06-05 21:53:23,268 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1086], 1=[array_4, v_prenex_1087]} [2021-06-05 21:53:23,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:53:23,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:23,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:53:23,275 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:23,327 INFO L628 ElimStorePlain]: treesize reduction 81, result has 42.6 percent of original size [2021-06-05 21:53:23,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:53:23,330 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:23,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:23,350 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:23,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:23,352 INFO L388 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 [2021-06-05 21:53:23,353 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:23,372 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:23,373 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:23,373 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 21:53:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:23,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143827887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:23,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:23,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:23,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630970451] [2021-06-05 21:53:23,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:23,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:23,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:23,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:23,447 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:24,061 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-06-05 21:53:24,234 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-06-05 21:53:24,354 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2021-06-05 21:53:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:24,428 INFO L93 Difference]: Finished difference Result 1151 states and 4413 transitions. [2021-06-05 21:53:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:53:24,428 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:24,430 INFO L225 Difference]: With dead ends: 1151 [2021-06-05 21:53:24,430 INFO L226 Difference]: Without dead ends: 1141 [2021-06-05 21:53:24,430 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 905.6ms TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:53:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2021-06-05 21:53:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 977. [2021-06-05 21:53:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 21:53:24,441 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 21:53:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:24,441 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 21:53:24,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 21:53:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:24,442 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:24,443 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:24,643 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 419 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5171 [2021-06-05 21:53:24,643 INFO L430 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:24,643 INFO L82 PathProgramCache]: Analyzing trace with hash 277070352, now seen corresponding path program 273 times [2021-06-05 21:53:24,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:24,643 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684056761] [2021-06-05 21:53:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:24,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:24,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684056761] [2021-06-05 21:53:24,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684056761] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:24,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437927328] [2021-06-05 21:53:24,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:24,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:53:24,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:24,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:24,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:24,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:24,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:24,989 INFO L388 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 11 [2021-06-05 21:53:24,990 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:24,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:24,993 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:24,994 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:25,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:25,032 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:53:25,032 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:85 [2021-06-05 21:53:25,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:25,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:25,215 INFO L388 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 17 treesize of output 13 [2021-06-05 21:53:25,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:25,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:25,219 INFO L388 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 19 treesize of output 15 [2021-06-05 21:53:25,220 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:25,281 INFO L628 ElimStorePlain]: treesize reduction 79, result has 43.6 percent of original size [2021-06-05 21:53:25,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:25,284 INFO L388 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 [2021-06-05 21:53:25,285 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:25,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:25,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:53:25,306 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:25,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:25,322 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1090 vanished before elimination [2021-06-05 21:53:25,324 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:25,324 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:154, output treesize:16 [2021-06-05 21:53:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:25,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437927328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:25,340 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:25,340 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:53:25,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691911184] [2021-06-05 21:53:25,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:53:25,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:25,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:53:25,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:53:25,341 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:25,735 INFO L93 Difference]: Finished difference Result 1013 states and 3942 transitions. [2021-06-05 21:53:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:25,735 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:25,737 INFO L225 Difference]: With dead ends: 1013 [2021-06-05 21:53:25,737 INFO L226 Difference]: Without dead ends: 1008 [2021-06-05 21:53:25,737 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 497.3ms TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2021-06-05 21:53:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 983. [2021-06-05 21:53:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9327902240325865) internal successors, (3862), 982 states have internal predecessors, (3862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3862 transitions. [2021-06-05 21:53:25,747 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3862 transitions. Word has length 18 [2021-06-05 21:53:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:25,747 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3862 transitions. [2021-06-05 21:53:25,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3862 transitions. [2021-06-05 21:53:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:25,748 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:25,749 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:25,949 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5183,420 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:25,949 INFO L430 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1662918394, now seen corresponding path program 274 times [2021-06-05 21:53:25,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:25,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698617810] [2021-06-05 21:53:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:26,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:26,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698617810] [2021-06-05 21:53:26,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698617810] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:26,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954084728] [2021-06-05 21:53:26,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:26,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:53:26,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:26,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:53:26,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:26,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,278 INFO L388 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 11 [2021-06-05 21:53:26,279 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:26,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,282 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:26,283 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:26,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:26,326 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:53:26,326 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:101 [2021-06-05 21:53:26,440 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 21:53:26,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,445 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:26,445 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:26,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,450 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:26,451 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:26,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,455 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:26,455 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:26,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,459 INFO L388 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 11 [2021-06-05 21:53:26,460 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:26,548 INFO L628 ElimStorePlain]: treesize reduction 108, result has 45.2 percent of original size [2021-06-05 21:53:26,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:26,552 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:26,552 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:26,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:26,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:26,587 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:231, output treesize:87 [2021-06-05 21:53:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:26,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954084728] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:26,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:26,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 21:53:26,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404303963] [2021-06-05 21:53:26,759 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:53:26,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:26,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:53:26,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:53:26,760 INFO L87 Difference]: Start difference. First operand 983 states and 3862 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:27,189 INFO L93 Difference]: Finished difference Result 1023 states and 3967 transitions. [2021-06-05 21:53:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:27,191 INFO L225 Difference]: With dead ends: 1023 [2021-06-05 21:53:27,191 INFO L226 Difference]: Without dead ends: 1011 [2021-06-05 21:53:27,191 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 501.4ms TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-06-05 21:53:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 980. [2021-06-05 21:53:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 21:53:27,201 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 21:53:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:27,201 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 21:53:27,201 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 21:53:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:27,203 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:27,203 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:27,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 421 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5210 [2021-06-05 21:53:27,403 INFO L430 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:27,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1758308222, now seen corresponding path program 275 times [2021-06-05 21:53:27,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:27,403 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771557171] [2021-06-05 21:53:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:27,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:27,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771557171] [2021-06-05 21:53:27,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771557171] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:27,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427932428] [2021-06-05 21:53:27,625 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:27,654 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:53:27,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:27,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:53:27,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:27,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,797 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:27,798 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:27,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,801 INFO L388 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 11 [2021-06-05 21:53:27,802 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:27,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:27,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:53:27,845 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:94 [2021-06-05 21:53:27,934 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 21:53:27,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,939 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:27,940 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:27,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,944 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:27,945 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:27,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,949 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:27,950 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:27,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:27,954 INFO L388 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 11 [2021-06-05 21:53:27,954 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:28,043 INFO L628 ElimStorePlain]: treesize reduction 110, result has 43.0 percent of original size [2021-06-05 21:53:28,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:28,047 INFO L388 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 [2021-06-05 21:53:28,048 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:28,081 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:28,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:28,083 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:231, output treesize:90 [2021-06-05 21:53:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:28,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427932428] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:28,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:28,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 21:53:28,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249532713] [2021-06-05 21:53:28,288 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:28,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:28,289 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:28,729 INFO L93 Difference]: Finished difference Result 1021 states and 3966 transitions. [2021-06-05 21:53:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:28,729 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:28,731 INFO L225 Difference]: With dead ends: 1021 [2021-06-05 21:53:28,731 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 21:53:28,731 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 574.4ms TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 21:53:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 980. [2021-06-05 21:53:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 21:53:28,741 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 21:53:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:28,741 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 21:53:28,741 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 21:53:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:28,742 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:28,742 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:28,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5235,422 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:28,943 INFO L430 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1987742664, now seen corresponding path program 276 times [2021-06-05 21:53:28,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:28,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715008400] [2021-06-05 21:53:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:29,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:29,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715008400] [2021-06-05 21:53:29,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715008400] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:29,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927969546] [2021-06-05 21:53:29,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:29,320 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:53:29,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:29,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:29,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:29,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,410 INFO L388 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 11 [2021-06-05 21:53:29,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:29,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,415 INFO L388 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 12 [2021-06-05 21:53:29,415 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:29,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,428 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:29,429 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:29,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,432 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:29,433 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:29,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:29,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:29,498 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:213, output treesize:181 [2021-06-05 21:53:29,807 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_1099, array_4], 3=[array_2, v_prenex_1098]} [2021-06-05 21:53:29,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,813 INFO L388 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 11 [2021-06-05 21:53:29,814 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:29,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,819 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:29,820 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:29,866 INFO L628 ElimStorePlain]: treesize reduction 87, result has 42.8 percent of original size [2021-06-05 21:53:29,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,869 INFO L388 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 27 treesize of output 21 [2021-06-05 21:53:29,870 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:29,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:29,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:29,889 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:29,890 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:29,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:29,907 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1098 vanished before elimination [2021-06-05 21:53:29,908 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:29,908 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:170, output treesize:16 [2021-06-05 21:53:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:29,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927969546] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:29,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:29,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 21:53:29,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169862858] [2021-06-05 21:53:29,937 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:29,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:29,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:29,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:29,938 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:30,324 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2021-06-05 21:53:30,608 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2021-06-05 21:53:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:30,719 INFO L93 Difference]: Finished difference Result 1019 states and 3957 transitions. [2021-06-05 21:53:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:30,720 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 21:53:30,721 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 21:53:30,721 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1043.5ms TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:53:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 21:53:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 984. [2021-06-05 21:53:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9338758901322484) internal successors, (3867), 983 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3867 transitions. [2021-06-05 21:53:30,731 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3867 transitions. Word has length 18 [2021-06-05 21:53:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:30,731 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3867 transitions. [2021-06-05 21:53:30,731 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3867 transitions. [2021-06-05 21:53:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:30,732 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:30,732 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:30,932 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 423 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5251 [2021-06-05 21:53:30,932 INFO L430 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash 367235886, now seen corresponding path program 277 times [2021-06-05 21:53:30,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:30,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373242097] [2021-06-05 21:53:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:31,216 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:31,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373242097] [2021-06-05 21:53:31,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373242097] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:31,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533595213] [2021-06-05 21:53:31,216 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:31,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 21:53:31,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:31,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,345 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:31,346 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,349 INFO L388 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 11 [2021-06-05 21:53:31,350 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,353 INFO L388 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 12 [2021-06-05 21:53:31,354 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,357 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:31,358 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:31,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:31,422 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:185, output treesize:153 [2021-06-05 21:53:31,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,595 INFO L388 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 11 [2021-06-05 21:53:31,596 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,599 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:31,600 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,604 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:31,605 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,608 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:31,609 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,678 INFO L628 ElimStorePlain]: treesize reduction 89, result has 44.0 percent of original size [2021-06-05 21:53:31,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:31,681 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:31,682 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:31,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:31,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:31,711 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:193, output treesize:56 [2021-06-05 21:53:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:31,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533595213] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:31,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:31,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 21:53:31,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176092760] [2021-06-05 21:53:31,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:53:31,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:31,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:53:31,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:53:31,840 INFO L87 Difference]: Start difference. First operand 984 states and 3867 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:32,325 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2021-06-05 21:53:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:32,570 INFO L93 Difference]: Finished difference Result 1035 states and 4003 transitions. [2021-06-05 21:53:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:32,570 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:32,572 INFO L225 Difference]: With dead ends: 1035 [2021-06-05 21:53:32,572 INFO L226 Difference]: Without dead ends: 1022 [2021-06-05 21:53:32,572 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 990.7ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:53:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-06-05 21:53:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 980. [2021-06-05 21:53:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 21:53:32,582 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 21:53:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:32,582 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 21:53:32,582 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 21:53:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:32,583 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:32,583 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:32,783 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5267,424 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:32,784 INFO L430 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1780649682, now seen corresponding path program 278 times [2021-06-05 21:53:32,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:32,784 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051834550] [2021-06-05 21:53:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:33,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:33,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051834550] [2021-06-05 21:53:33,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051834550] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:33,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124353794] [2021-06-05 21:53:33,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:33,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:53:33,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:33,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:33,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:33,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,254 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:33,261 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:33,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,265 INFO L388 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 11 [2021-06-05 21:53:33,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:33,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,270 INFO L388 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 12 [2021-06-05 21:53:33,270 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:33,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,273 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:33,281 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:33,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:33,336 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:53:33,336 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:173, output treesize:141 [2021-06-05 21:53:33,518 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 21:53:33,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,521 INFO L388 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 11 [2021-06-05 21:53:33,522 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:33,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,525 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:33,526 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:33,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,529 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:33,530 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:33,533 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:33,533 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:33,588 INFO L628 ElimStorePlain]: treesize reduction 90, result has 37.9 percent of original size [2021-06-05 21:53:33,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:33,591 INFO L388 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 [2021-06-05 21:53:33,592 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:33,612 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:33,614 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:33,614 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 21:53:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:33,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124353794] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:33,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:33,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:33,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852138464] [2021-06-05 21:53:33,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:33,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:33,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:33,683 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:34,161 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2021-06-05 21:53:34,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:34,635 INFO L93 Difference]: Finished difference Result 1026 states and 3994 transitions. [2021-06-05 21:53:34,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:53:34,636 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:34,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:34,637 INFO L225 Difference]: With dead ends: 1026 [2021-06-05 21:53:34,637 INFO L226 Difference]: Without dead ends: 1021 [2021-06-05 21:53:34,637 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1089.4ms TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:53:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-06-05 21:53:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 980. [2021-06-05 21:53:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 21:53:34,653 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 21:53:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:34,653 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 21:53:34,653 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 21:53:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:34,655 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:34,655 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:34,855 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 425 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5283 [2021-06-05 21:53:34,855 INFO L430 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2015362562, now seen corresponding path program 279 times [2021-06-05 21:53:34,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:34,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983299749] [2021-06-05 21:53:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:35,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:35,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983299749] [2021-06-05 21:53:35,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983299749] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:35,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145675017] [2021-06-05 21:53:35,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:35,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:53:35,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:35,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:35,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:35,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,273 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:35,273 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,277 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:35,278 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,281 INFO L388 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 11 [2021-06-05 21:53:35,282 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,285 INFO L388 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 12 [2021-06-05 21:53:35,285 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:35,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:53:35,327 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:109 [2021-06-05 21:53:35,515 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 21:53:35,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,518 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:35,519 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,522 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:35,523 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,527 INFO L388 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 11 [2021-06-05 21:53:35,527 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,530 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:35,531 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,585 INFO L628 ElimStorePlain]: treesize reduction 76, result has 44.5 percent of original size [2021-06-05 21:53:35,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:35,588 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:35,589 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:35,619 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:35,620 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:35,620 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 21:53:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:35,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145675017] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:35,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:35,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:35,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958108088] [2021-06-05 21:53:35,690 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:35,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:35,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:35,691 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:36,619 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2021-06-05 21:53:36,773 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2021-06-05 21:53:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:36,845 INFO L93 Difference]: Finished difference Result 1155 states and 4452 transitions. [2021-06-05 21:53:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:53:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:36,847 INFO L225 Difference]: With dead ends: 1155 [2021-06-05 21:53:36,847 INFO L226 Difference]: Without dead ends: 1150 [2021-06-05 21:53:36,847 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1193.7ms TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:53:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2021-06-05 21:53:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 981. [2021-06-05 21:53:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9306122448979592) internal successors, (3852), 980 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3852 transitions. [2021-06-05 21:53:36,865 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3852 transitions. Word has length 18 [2021-06-05 21:53:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:36,866 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3852 transitions. [2021-06-05 21:53:36,866 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3852 transitions. [2021-06-05 21:53:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:36,867 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:36,867 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:37,067 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5308,426 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:37,067 INFO L430 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash -740413884, now seen corresponding path program 280 times [2021-06-05 21:53:37,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:37,068 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055176940] [2021-06-05 21:53:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:37,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:37,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055176940] [2021-06-05 21:53:37,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055176940] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:37,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921250] [2021-06-05 21:53:37,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:37,392 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:53:37,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:37,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:37,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:37,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,494 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:37,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:37,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,498 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:37,499 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:37,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,502 INFO L388 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 12 [2021-06-05 21:53:37,503 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:37,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,506 INFO L388 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 11 [2021-06-05 21:53:37,507 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:37,545 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:37,548 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:53:37,548 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:135, output treesize:99 [2021-06-05 21:53:37,781 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 21:53:37,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,784 INFO L388 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 11 [2021-06-05 21:53:37,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:37,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,788 INFO L388 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 27 treesize of output 21 [2021-06-05 21:53:37,791 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:37,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,794 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:37,795 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:37,798 INFO L388 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 17 treesize of output 13 [2021-06-05 21:53:37,799 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:37,863 INFO L628 ElimStorePlain]: treesize reduction 80, result has 40.7 percent of original size [2021-06-05 21:53:37,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:37,866 INFO L388 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 [2021-06-05 21:53:37,867 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:37,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:37,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:37,890 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 21:53:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:37,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921250] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:37,959 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:37,959 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:37,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068598878] [2021-06-05 21:53:37,959 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:37,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:37,959 INFO L87 Difference]: Start difference. First operand 981 states and 3852 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:38,432 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2021-06-05 21:53:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:38,724 INFO L93 Difference]: Finished difference Result 1055 states and 4095 transitions. [2021-06-05 21:53:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:38,724 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:38,726 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 21:53:38,726 INFO L226 Difference]: Without dead ends: 1050 [2021-06-05 21:53:38,726 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 944.1ms TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:53:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-06-05 21:53:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 978. [2021-06-05 21:53:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 21:53:38,737 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 21:53:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:38,737 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 21:53:38,737 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 21:53:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:38,739 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:38,739 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:38,939 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 427 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5333 [2021-06-05 21:53:38,939 INFO L430 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash -145415374, now seen corresponding path program 281 times [2021-06-05 21:53:38,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:38,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617572993] [2021-06-05 21:53:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:39,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:39,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617572993] [2021-06-05 21:53:39,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617572993] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:39,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024825632] [2021-06-05 21:53:39,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:39,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:53:39,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:39,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:39,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:39,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:39,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:39,302 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:39,302 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:39,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:39,305 INFO L388 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 11 [2021-06-05 21:53:39,306 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:39,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:39,345 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:53:39,345 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 21:53:39,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:39,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:39,520 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:39,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:39,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:39,524 INFO L388 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 27 treesize of output 21 [2021-06-05 21:53:39,525 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:39,575 INFO L628 ElimStorePlain]: treesize reduction 83, result has 42.4 percent of original size [2021-06-05 21:53:39,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:39,578 INFO L388 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 [2021-06-05 21:53:39,580 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:39,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:39,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:53:39,601 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:39,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:39,617 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1113 vanished before elimination [2021-06-05 21:53:39,619 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:39,619 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:162, output treesize:16 [2021-06-05 21:53:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:39,636 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024825632] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:39,636 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:39,636 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:53:39,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998667361] [2021-06-05 21:53:39,636 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:53:39,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:39,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:53:39,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:53:39,636 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:40,101 INFO L93 Difference]: Finished difference Result 1002 states and 3899 transitions. [2021-06-05 21:53:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:40,102 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:40,103 INFO L225 Difference]: With dead ends: 1002 [2021-06-05 21:53:40,103 INFO L226 Difference]: Without dead ends: 997 [2021-06-05 21:53:40,103 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 498.2ms TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-06-05 21:53:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 985. [2021-06-05 21:53:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 3.928861788617886) internal successors, (3866), 984 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 3866 transitions. [2021-06-05 21:53:40,114 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 3866 transitions. Word has length 18 [2021-06-05 21:53:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:40,114 INFO L482 AbstractCegarLoop]: Abstraction has 985 states and 3866 transitions. [2021-06-05 21:53:40,114 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 3866 transitions. [2021-06-05 21:53:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:40,115 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:40,115 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:40,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5358,428 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:40,315 INFO L430 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:40,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2085404120, now seen corresponding path program 282 times [2021-06-05 21:53:40,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:40,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552814734] [2021-06-05 21:53:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:40,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:40,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552814734] [2021-06-05 21:53:40,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552814734] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:40,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491321618] [2021-06-05 21:53:40,512 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:40,539 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:53:40,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:40,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:40,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:40,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:40,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:40,662 INFO L388 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 11 [2021-06-05 21:53:40,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:40,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:40,666 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:40,666 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:40,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:40,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:53:40,705 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 21:53:40,797 INFO L446 ElimStorePlain]: Different costs {1=[array_4, v_prenex_1118], 3=[array_2, v_prenex_1117]} [2021-06-05 21:53:40,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:40,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:40,802 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:40,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:40,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:40,807 INFO L388 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 11 [2021-06-05 21:53:40,807 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:40,875 INFO L628 ElimStorePlain]: treesize reduction 111, result has 42.5 percent of original size [2021-06-05 21:53:40,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:40,878 INFO L388 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 27 treesize of output 21 [2021-06-05 21:53:40,879 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:40,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:40,906 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:53:40,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:40,909 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:40,910 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:40,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:40,945 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:40,945 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:207, output treesize:35 [2021-06-05 21:53:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:40,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491321618] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:40,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:40,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:53:40,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798273173] [2021-06-05 21:53:40,996 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:53:40,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:40,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:53:40,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:53:40,997 INFO L87 Difference]: Start difference. First operand 985 states and 3866 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:41,407 INFO L93 Difference]: Finished difference Result 1012 states and 3931 transitions. [2021-06-05 21:53:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:41,409 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 21:53:41,409 INFO L226 Difference]: Without dead ends: 1007 [2021-06-05 21:53:41,409 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 449.4ms TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-06-05 21:53:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 982. [2021-06-05 21:53:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.928644240570846) internal successors, (3854), 981 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3854 transitions. [2021-06-05 21:53:41,419 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3854 transitions. Word has length 18 [2021-06-05 21:53:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:41,419 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3854 transitions. [2021-06-05 21:53:41,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3854 transitions. [2021-06-05 21:53:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:41,420 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:41,420 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:41,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 429 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5385 [2021-06-05 21:53:41,621 INFO L430 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:41,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1335822496, now seen corresponding path program 283 times [2021-06-05 21:53:41,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:41,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644089659] [2021-06-05 21:53:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:41,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:41,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644089659] [2021-06-05 21:53:41,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644089659] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:41,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709248280] [2021-06-05 21:53:41,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:41,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:41,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:42,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:42,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:42,012 INFO L388 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 11 [2021-06-05 21:53:42,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:42,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:42,016 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:42,016 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:42,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:42,042 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 21:53:42,042 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:66 [2021-06-05 21:53:42,120 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 21:53:42,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:42,124 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:42,125 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:42,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:42,128 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:42,129 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:42,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:42,132 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:42,133 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:42,136 INFO L388 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 11 [2021-06-05 21:53:42,137 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:42,185 INFO L628 ElimStorePlain]: treesize reduction 84, result has 42.1 percent of original size [2021-06-05 21:53:42,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:42,188 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:42,189 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:42,209 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:42,211 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:42,211 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 21:53:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:42,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709248280] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:42,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:42,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:42,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855717580] [2021-06-05 21:53:42,277 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:42,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:42,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:42,277 INFO L87 Difference]: Start difference. First operand 982 states and 3854 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:42,950 INFO L93 Difference]: Finished difference Result 1007 states and 3921 transitions. [2021-06-05 21:53:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:42,952 INFO L225 Difference]: With dead ends: 1007 [2021-06-05 21:53:42,952 INFO L226 Difference]: Without dead ends: 1002 [2021-06-05 21:53:42,952 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 741.2ms TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:53:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2021-06-05 21:53:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 979. [2021-06-05 21:53:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 3.9314928425357873) internal successors, (3845), 978 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 3845 transitions. [2021-06-05 21:53:42,962 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 3845 transitions. Word has length 18 [2021-06-05 21:53:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:42,962 INFO L482 AbstractCegarLoop]: Abstraction has 979 states and 3845 transitions. [2021-06-05 21:53:42,962 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 3845 transitions. [2021-06-05 21:53:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:42,963 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:42,964 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:43,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 430 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5398 [2021-06-05 21:53:43,164 INFO L430 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1884738906, now seen corresponding path program 284 times [2021-06-05 21:53:43,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:43,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045153701] [2021-06-05 21:53:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:43,462 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:43,462 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045153701] [2021-06-05 21:53:43,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045153701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:43,462 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759391343] [2021-06-05 21:53:43,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:43,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:53:43,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:43,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:43,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:43,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:43,577 INFO L388 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 11 [2021-06-05 21:53:43,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:43,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:43,581 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:43,582 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:43,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:43,585 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:43,586 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:43,589 INFO L388 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 12 [2021-06-05 21:53:43,589 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:43,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:43,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:43,646 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 21:53:43,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:43,840 INFO L388 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 17 treesize of output 13 [2021-06-05 21:53:43,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:43,871 INFO L628 ElimStorePlain]: treesize reduction 62, result has 37.4 percent of original size [2021-06-05 21:53:43,872 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:43,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:43,874 INFO L388 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 19 treesize of output 15 [2021-06-05 21:53:43,874 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:43,883 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:43,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:43,885 INFO L388 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 12 treesize of output 8 [2021-06-05 21:53:43,886 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:43,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:43,896 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:43,896 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 21:53:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:43,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759391343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:43,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:43,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:43,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209484598] [2021-06-05 21:53:43,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:43,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:43,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:43,924 INFO L87 Difference]: Start difference. First operand 979 states and 3845 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:44,373 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-06-05 21:53:44,662 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2021-06-05 21:53:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:44,758 INFO L93 Difference]: Finished difference Result 1008 states and 3916 transitions. [2021-06-05 21:53:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:44,759 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:44,760 INFO L225 Difference]: With dead ends: 1008 [2021-06-05 21:53:44,760 INFO L226 Difference]: Without dead ends: 1003 [2021-06-05 21:53:44,761 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1014.9ms TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:53:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-06-05 21:53:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 986. [2021-06-05 21:53:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 3.931979695431472) internal successors, (3873), 985 states have internal predecessors, (3873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 3873 transitions. [2021-06-05 21:53:44,770 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 3873 transitions. Word has length 18 [2021-06-05 21:53:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:44,771 INFO L482 AbstractCegarLoop]: Abstraction has 986 states and 3873 transitions. [2021-06-05 21:53:44,771 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 3873 transitions. [2021-06-05 21:53:44,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:44,772 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:44,772 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:44,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5412,431 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:44,972 INFO L430 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash -55249840, now seen corresponding path program 285 times [2021-06-05 21:53:44,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:44,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827959330] [2021-06-05 21:53:44,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:45,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:45,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827959330] [2021-06-05 21:53:45,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827959330] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:45,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394385781] [2021-06-05 21:53:45,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:45,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:53:45,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:45,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:45,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:45,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,428 INFO L388 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 11 [2021-06-05 21:53:45,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:45,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,432 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:45,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:45,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,436 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:45,437 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:45,440 INFO L388 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 12 [2021-06-05 21:53:45,440 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:45,483 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:45,484 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:45,484 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:131 [2021-06-05 21:53:45,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,614 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:45,615 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:45,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,618 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:45,619 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:45,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,622 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:45,623 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:45,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,626 INFO L388 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 11 [2021-06-05 21:53:45,627 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:45,674 INFO L628 ElimStorePlain]: treesize reduction 83, result has 38.5 percent of original size [2021-06-05 21:53:45,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:45,677 INFO L388 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 [2021-06-05 21:53:45,678 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:45,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:45,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:45,698 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:169, output treesize:44 [2021-06-05 21:53:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:45,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394385781] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:45,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:45,772 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:53:45,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297018543] [2021-06-05 21:53:45,772 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:45,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:45,772 INFO L87 Difference]: Start difference. First operand 986 states and 3873 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:46,212 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-06-05 21:53:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:46,505 INFO L93 Difference]: Finished difference Result 1024 states and 3972 transitions. [2021-06-05 21:53:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:46,505 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:46,507 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 21:53:46,507 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 21:53:46,507 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 913.4ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:53:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 21:53:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 979. [2021-06-05 21:53:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 3.9314928425357873) internal successors, (3845), 978 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 3845 transitions. [2021-06-05 21:53:46,517 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 3845 transitions. Word has length 18 [2021-06-05 21:53:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:46,517 INFO L482 AbstractCegarLoop]: Abstraction has 979 states and 3845 transitions. [2021-06-05 21:53:46,517 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 3845 transitions. [2021-06-05 21:53:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:46,519 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:46,519 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:46,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5427,432 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:46,719 INFO L430 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:46,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2091831888, now seen corresponding path program 286 times [2021-06-05 21:53:46,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:46,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9291904] [2021-06-05 21:53:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:46,995 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:46,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9291904] [2021-06-05 21:53:46,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9291904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:46,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679223125] [2021-06-05 21:53:46,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:47,023 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:53:47,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:47,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:53:47,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:47,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,104 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:47,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:47,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,109 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:47,110 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:47,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,114 INFO L388 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 12 [2021-06-05 21:53:47,115 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:47,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,118 INFO L388 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 11 [2021-06-05 21:53:47,119 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:47,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:47,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:47,184 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:163 [2021-06-05 21:53:47,442 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 21:53:47,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,447 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:47,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:47,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,452 INFO L388 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 17 treesize of output 13 [2021-06-05 21:53:47,453 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:47,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,458 INFO L388 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 27 treesize of output 21 [2021-06-05 21:53:47,459 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:47,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,463 INFO L388 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 11 [2021-06-05 21:53:47,463 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:47,541 INFO L628 ElimStorePlain]: treesize reduction 110, result has 43.0 percent of original size [2021-06-05 21:53:47,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:47,545 INFO L388 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 [2021-06-05 21:53:47,546 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:47,580 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:47,582 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:47,582 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:223, output treesize:87 [2021-06-05 21:53:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:47,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679223125] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:47,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:47,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 21:53:47,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169833493] [2021-06-05 21:53:47,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:53:47,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:47,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:53:47,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:53:47,778 INFO L87 Difference]: Start difference. First operand 979 states and 3845 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:48,124 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2021-06-05 21:53:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:48,359 INFO L93 Difference]: Finished difference Result 1012 states and 3934 transitions. [2021-06-05 21:53:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:48,361 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 21:53:48,361 INFO L226 Difference]: Without dead ends: 999 [2021-06-05 21:53:48,361 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 887.3ms TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:53:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-06-05 21:53:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 978. [2021-06-05 21:53:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 21:53:48,374 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 21:53:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:48,374 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 21:53:48,374 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 21:53:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:48,375 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:48,375 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:48,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 433 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5442 [2021-06-05 21:53:48,576 INFO L430 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:48,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1441839766, now seen corresponding path program 287 times [2021-06-05 21:53:48,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:48,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178473084] [2021-06-05 21:53:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:48,981 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:48,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178473084] [2021-06-05 21:53:48,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178473084] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:48,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629873024] [2021-06-05 21:53:48,981 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:49,010 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:53:49,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:49,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:49,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:49,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:49,117 INFO L388 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 12 [2021-06-05 21:53:49,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:49,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:49,121 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:49,121 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:49,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:49,125 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:49,125 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:49,128 INFO L388 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 11 [2021-06-05 21:53:49,129 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:49,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:49,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:49,180 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 21:53:49,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:53:49,346 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:49,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 21:53:49,348 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:49,362 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 21:53:49,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 21:53:49,364 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:49,370 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:49,371 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:49,371 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 21:53:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:49,400 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629873024] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:49,400 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:49,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:53:49,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829261801] [2021-06-05 21:53:49,400 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:53:49,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:49,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:53:49,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:49,401 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:49,909 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2021-06-05 21:53:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:50,286 INFO L93 Difference]: Finished difference Result 1007 states and 3912 transitions. [2021-06-05 21:53:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:53:50,286 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:50,288 INFO L225 Difference]: With dead ends: 1007 [2021-06-05 21:53:50,288 INFO L226 Difference]: Without dead ends: 1002 [2021-06-05 21:53:50,288 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1176.0ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:53:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2021-06-05 21:53:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 984. [2021-06-05 21:53:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9338758901322484) internal successors, (3867), 983 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3867 transitions. [2021-06-05 21:53:50,298 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3867 transitions. Word has length 18 [2021-06-05 21:53:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:50,298 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3867 transitions. [2021-06-05 21:53:50,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3867 transitions. [2021-06-05 21:53:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:50,300 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:50,300 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:50,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5456,434 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:50,500 INFO L430 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -498148980, now seen corresponding path program 288 times [2021-06-05 21:53:50,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:50,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549835243] [2021-06-05 21:53:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:50,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:50,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549835243] [2021-06-05 21:53:50,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549835243] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:50,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035970114] [2021-06-05 21:53:50,966 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:50,993 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:53:50,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:50,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:50,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:51,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:51,092 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:51,092 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:51,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:51,095 INFO L388 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 11 [2021-06-05 21:53:51,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:51,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:51,099 INFO L388 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 12 [2021-06-05 21:53:51,100 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:51,102 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:51,103 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:51,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:51,140 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:51,140 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 21:53:51,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:51,258 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:51,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:51,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:51,261 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:51,262 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:51,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:51,265 INFO L388 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 11 [2021-06-05 21:53:51,266 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:51,268 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:51,269 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:51,308 INFO L628 ElimStorePlain]: treesize reduction 70, result has 38.1 percent of original size [2021-06-05 21:53:51,310 INFO L388 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 [2021-06-05 21:53:51,311 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:51,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:51,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:51,327 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:53:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:51,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035970114] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:51,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:51,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:53:51,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226658414] [2021-06-05 21:53:51,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:53:51,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:53:51,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:53:51,397 INFO L87 Difference]: Start difference. First operand 984 states and 3867 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:51,899 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 21:53:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:52,375 INFO L93 Difference]: Finished difference Result 1023 states and 3966 transitions. [2021-06-05 21:53:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:53:52,377 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:52,378 INFO L225 Difference]: With dead ends: 1023 [2021-06-05 21:53:52,379 INFO L226 Difference]: Without dead ends: 1018 [2021-06-05 21:53:52,379 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1200.4ms TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:53:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-06-05 21:53:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 978. [2021-06-05 21:53:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 21:53:52,389 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 21:53:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:52,389 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 21:53:52,389 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 21:53:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:52,390 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:52,390 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:52,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 435 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5470 [2021-06-05 21:53:52,591 INFO L430 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:52,591 INFO L82 PathProgramCache]: Analyzing trace with hash 763134468, now seen corresponding path program 289 times [2021-06-05 21:53:52,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:52,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365309995] [2021-06-05 21:53:52,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:53,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:53,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365309995] [2021-06-05 21:53:53,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365309995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:53,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926395545] [2021-06-05 21:53:53,434 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:53,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:53:53,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:53,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:53,575 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:53,576 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:53,579 INFO L388 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 12 [2021-06-05 21:53:53,579 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:53,583 INFO L388 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 11 [2021-06-05 21:53:53,583 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,586 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:53,587 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:53,632 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:53,632 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 21:53:53,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:53,766 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:53,767 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:53,769 INFO L388 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 35 treesize of output 27 [2021-06-05 21:53:53,770 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:53,773 INFO L388 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 11 [2021-06-05 21:53:53,774 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,776 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:53,777 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,824 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 21:53:53,826 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:53,827 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:53,842 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:53,843 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:53,843 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:53:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:53,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926395545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:53,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:53,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:53:53,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143207248] [2021-06-05 21:53:53,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:53:53,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:53,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:53:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:53:53,921 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:54,236 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2021-06-05 21:53:54,402 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-06-05 21:53:54,728 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 21:53:54,952 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2021-06-05 21:53:55,284 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-06-05 21:53:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:55,354 INFO L93 Difference]: Finished difference Result 1011 states and 3933 transitions. [2021-06-05 21:53:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:53:55,355 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:55,356 INFO L225 Difference]: With dead ends: 1011 [2021-06-05 21:53:55,356 INFO L226 Difference]: Without dead ends: 1006 [2021-06-05 21:53:55,357 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1950.2ms TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:53:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-06-05 21:53:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 980. [2021-06-05 21:53:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 21:53:55,367 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 21:53:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:55,367 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 21:53:55,367 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 21:53:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:55,368 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:55,368 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:55,568 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5484,436 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:55,569 INFO L430 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -255309622, now seen corresponding path program 290 times [2021-06-05 21:53:55,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:55,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327649154] [2021-06-05 21:53:55,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:55,941 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:55,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327649154] [2021-06-05 21:53:55,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327649154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:55,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882364932] [2021-06-05 21:53:55,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:55,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:53:55,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:55,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:55,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:56,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:56,049 INFO L388 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 11 [2021-06-05 21:53:56,050 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:56,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:56,053 INFO L388 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 12 [2021-06-05 21:53:56,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:56,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:56,056 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:56,057 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:56,059 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:56,060 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:56,097 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:56,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:56,098 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:93 [2021-06-05 21:53:56,266 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1132], 1=[array_4, v_prenex_1133]} [2021-06-05 21:53:56,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:53:56,270 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:56,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:53:56,273 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:56,319 INFO L628 ElimStorePlain]: treesize reduction 75, result has 41.9 percent of original size [2021-06-05 21:53:56,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:53:56,322 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:56,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:56,337 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:56,339 INFO L388 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 22 treesize of output 14 [2021-06-05 21:53:56,340 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:56,355 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:56,356 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:56,356 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 21:53:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:56,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882364932] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:56,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:56,427 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:53:56,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243495616] [2021-06-05 21:53:56,427 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:53:56,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:53:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:53:56,428 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:56,847 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-06-05 21:53:57,210 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2021-06-05 21:53:57,428 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2021-06-05 21:53:57,651 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2021-06-05 21:53:57,835 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2021-06-05 21:53:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:53:57,913 INFO L93 Difference]: Finished difference Result 1121 states and 4276 transitions. [2021-06-05 21:53:57,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:53:57,913 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:53:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:53:57,915 INFO L225 Difference]: With dead ends: 1121 [2021-06-05 21:53:57,915 INFO L226 Difference]: Without dead ends: 1111 [2021-06-05 21:53:57,915 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1624.2ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:53:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-06-05 21:53:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 982. [2021-06-05 21:53:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.928644240570846) internal successors, (3854), 981 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3854 transitions. [2021-06-05 21:53:57,926 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3854 transitions. Word has length 18 [2021-06-05 21:53:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:53:57,926 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3854 transitions. [2021-06-05 21:53:57,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3854 transitions. [2021-06-05 21:53:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:53:57,927 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:53:57,927 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:53:58,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 437 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5498 [2021-06-05 21:53:58,128 INFO L430 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:53:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:53:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1019639056, now seen corresponding path program 291 times [2021-06-05 21:53:58,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:53:58,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417991575] [2021-06-05 21:53:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:53:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:53:58,405 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2021-06-05 21:53:58,542 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2021-06-05 21:53:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:58,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:53:58,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417991575] [2021-06-05 21:53:58,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417991575] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:58,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735997691] [2021-06-05 21:53:58,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:53:58,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:53:58,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:53:58,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:53:58,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:53:58,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:58,909 INFO L388 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 11 [2021-06-05 21:53:58,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:58,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:58,912 INFO L388 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 12 [2021-06-05 21:53:58,913 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:58,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:53:58,916 INFO L388 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 25 treesize of output 19 [2021-06-05 21:53:58,916 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:58,919 INFO L388 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 26 treesize of output 20 [2021-06-05 21:53:58,920 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:58,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:58,957 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:53:58,957 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 21:53:59,146 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1134], 1=[array_4, v_prenex_1135]} [2021-06-05 21:53:59,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:53:59,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:59,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:53:59,154 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:59,198 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 21:53:59,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:53:59,201 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:53:59,217 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:59,217 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:53:59,219 INFO L388 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 [2021-06-05 21:53:59,220 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:53:59,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:53:59,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:53:59,236 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 21:53:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:53:59,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735997691] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:53:59,323 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:53:59,323 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:53:59,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891171289] [2021-06-05 21:53:59,323 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:53:59,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:53:59,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:53:59,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:53:59,323 INFO L87 Difference]: Start difference. First operand 982 states and 3854 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:53:59,781 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 21:54:00,056 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2021-06-05 21:54:00,371 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2021-06-05 21:54:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:00,784 INFO L93 Difference]: Finished difference Result 1066 states and 4047 transitions. [2021-06-05 21:54:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:54:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:00,786 INFO L225 Difference]: With dead ends: 1066 [2021-06-05 21:54:00,786 INFO L226 Difference]: Without dead ends: 1057 [2021-06-05 21:54:00,787 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1796.4ms TimeCoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2021-06-05 21:54:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-06-05 21:54:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 985. [2021-06-05 21:54:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 3.928861788617886) internal successors, (3866), 984 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 3866 transitions. [2021-06-05 21:54:00,797 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 3866 transitions. Word has length 18 [2021-06-05 21:54:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:00,797 INFO L482 AbstractCegarLoop]: Abstraction has 985 states and 3866 transitions. [2021-06-05 21:54:00,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 3866 transitions. [2021-06-05 21:54:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:00,798 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:00,798 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:00,999 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 438 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5515 [2021-06-05 21:54:00,999 INFO L430 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash -651336960, now seen corresponding path program 292 times [2021-06-05 21:54:00,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:00,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597302003] [2021-06-05 21:54:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:01,197 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2021-06-05 21:54:01,456 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2021-06-05 21:54:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:01,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:01,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597302003] [2021-06-05 21:54:01,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597302003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:01,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651649707] [2021-06-05 21:54:01,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:01,807 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:54:01,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:01,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:54:01,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:01,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:01,898 INFO L388 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 11 [2021-06-05 21:54:01,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:01,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:01,901 INFO L388 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 12 [2021-06-05 21:54:01,902 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:01,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:01,905 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:01,905 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:01,908 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:01,908 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:01,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:01,946 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:01,946 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 21:54:02,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:02,185 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:02,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:02,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:02,188 INFO L388 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 35 treesize of output 27 [2021-06-05 21:54:02,189 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:02,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:02,192 INFO L388 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 11 [2021-06-05 21:54:02,193 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:02,195 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:02,196 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:02,238 INFO L628 ElimStorePlain]: treesize reduction 81, result has 36.2 percent of original size [2021-06-05 21:54:02,240 INFO L388 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 [2021-06-05 21:54:02,242 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:02,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:02,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:02,259 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 21:54:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:02,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651649707] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:02,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:02,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 21:54:02,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55882732] [2021-06-05 21:54:02,339 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 21:54:02,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 21:54:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:54:02,339 INFO L87 Difference]: Start difference. First operand 985 states and 3866 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:02,774 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2021-06-05 21:54:03,009 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2021-06-05 21:54:03,594 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2021-06-05 21:54:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:03,909 INFO L93 Difference]: Finished difference Result 1054 states and 4021 transitions. [2021-06-05 21:54:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 21:54:03,909 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:03,911 INFO L225 Difference]: With dead ends: 1054 [2021-06-05 21:54:03,911 INFO L226 Difference]: Without dead ends: 1035 [2021-06-05 21:54:03,911 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2044.2ms TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2021-06-05 21:54:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2021-06-05 21:54:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 981. [2021-06-05 21:54:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9306122448979592) internal successors, (3852), 980 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3852 transitions. [2021-06-05 21:54:03,921 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3852 transitions. Word has length 18 [2021-06-05 21:54:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:03,921 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3852 transitions. [2021-06-05 21:54:03,921 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3852 transitions. [2021-06-05 21:54:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:03,923 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:03,923 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:04,123 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 439 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5531 [2021-06-05 21:54:04,123 INFO L430 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1349294162, now seen corresponding path program 293 times [2021-06-05 21:54:04,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:04,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053627002] [2021-06-05 21:54:04,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:04,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:04,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053627002] [2021-06-05 21:54:04,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053627002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:04,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028726904] [2021-06-05 21:54:04,433 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:04,461 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:54:04,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:04,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:04,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:04,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:04,562 INFO L388 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 12 [2021-06-05 21:54:04,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:04,566 INFO L388 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 11 [2021-06-05 21:54:04,567 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:04,570 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:04,571 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,573 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:04,574 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:04,613 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:04,614 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 21:54:04,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:04,730 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:04,731 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:04,743 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:04,744 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:04,747 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:04,748 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,750 INFO L388 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 11 [2021-06-05 21:54:04,750 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,789 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 21:54:04,791 INFO L388 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 22 treesize of output 14 [2021-06-05 21:54:04,792 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:04,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:04,807 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:04,807 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:54:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:04,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028726904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:04,876 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:04,876 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:54:04,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840243910] [2021-06-05 21:54:04,876 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:54:04,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:54:04,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:54:04,877 INFO L87 Difference]: Start difference. First operand 981 states and 3852 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:05,485 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 21:54:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:05,902 INFO L93 Difference]: Finished difference Result 1020 states and 3953 transitions. [2021-06-05 21:54:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:54:05,902 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:05,903 INFO L225 Difference]: With dead ends: 1020 [2021-06-05 21:54:05,903 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 21:54:05,904 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1061.7ms TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:54:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 21:54:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 978. [2021-06-05 21:54:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 21:54:05,914 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 21:54:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:05,914 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 21:54:05,914 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 21:54:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:05,915 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:05,915 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:06,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5544,440 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:06,115 INFO L430 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:06,116 INFO L82 PathProgramCache]: Analyzing trace with hash -781882228, now seen corresponding path program 294 times [2021-06-05 21:54:06,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:06,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866036780] [2021-06-05 21:54:06,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:06,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:06,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866036780] [2021-06-05 21:54:06,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866036780] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:06,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290588481] [2021-06-05 21:54:06,307 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:06,335 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:54:06,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:06,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:06,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:06,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:06,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:06,436 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:06,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:06,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:06,440 INFO L388 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 11 [2021-06-05 21:54:06,441 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:06,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:06,473 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:06,473 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:74 [2021-06-05 21:54:06,641 INFO L446 ElimStorePlain]: Different costs {1=[array_2, v_prenex_1140, v_prenex_1139], 3=[array_4]} [2021-06-05 21:54:06,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:06,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:06,645 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:06,646 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:06,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:06,649 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:06,650 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:06,682 INFO L628 ElimStorePlain]: treesize reduction 66, result has 35.3 percent of original size [2021-06-05 21:54:06,682 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1140 vanished before elimination [2021-06-05 21:54:06,682 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1139 vanished before elimination [2021-06-05 21:54:06,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:06,684 INFO L388 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 [2021-06-05 21:54:06,686 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:06,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:06,698 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:06,698 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:124, output treesize:16 [2021-06-05 21:54:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:06,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290588481] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:06,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:06,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:06,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487176134] [2021-06-05 21:54:06,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:06,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:06,715 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:07,133 INFO L93 Difference]: Finished difference Result 1012 states and 3929 transitions. [2021-06-05 21:54:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:07,135 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 21:54:07,135 INFO L226 Difference]: Without dead ends: 1007 [2021-06-05 21:54:07,135 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 546.9ms TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:54:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-06-05 21:54:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 981. [2021-06-05 21:54:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9326530612244897) internal successors, (3854), 980 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3854 transitions. [2021-06-05 21:54:07,145 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3854 transitions. Word has length 18 [2021-06-05 21:54:07,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:07,146 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3854 transitions. [2021-06-05 21:54:07,146 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3854 transitions. [2021-06-05 21:54:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:07,147 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:07,147 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:07,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 441 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5558 [2021-06-05 21:54:07,347 INFO L430 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1573096322, now seen corresponding path program 295 times [2021-06-05 21:54:07,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:07,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348959005] [2021-06-05 21:54:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:07,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:07,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348959005] [2021-06-05 21:54:07,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348959005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:07,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528307632] [2021-06-05 21:54:07,540 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:07,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:54:07,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:07,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,671 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:07,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:07,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,675 INFO L388 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 11 [2021-06-05 21:54:07,676 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:07,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:07,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:07,711 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:86 [2021-06-05 21:54:07,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,784 INFO L388 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 11 [2021-06-05 21:54:07,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:07,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,788 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:07,789 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:07,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,793 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:07,793 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:07,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,797 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:07,797 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:07,875 INFO L628 ElimStorePlain]: treesize reduction 107, result has 41.5 percent of original size [2021-06-05 21:54:07,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:07,878 INFO L388 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 [2021-06-05 21:54:07,879 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:07,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:07,913 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:07,914 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:209, output treesize:68 [2021-06-05 21:54:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:08,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528307632] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:08,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:08,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 21:54:08,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122757918] [2021-06-05 21:54:08,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:54:08,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:08,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:54:08,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:54:08,074 INFO L87 Difference]: Start difference. First operand 981 states and 3854 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:08,369 INFO L93 Difference]: Finished difference Result 1022 states and 3954 transitions. [2021-06-05 21:54:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:08,369 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:08,371 INFO L225 Difference]: With dead ends: 1022 [2021-06-05 21:54:08,371 INFO L226 Difference]: Without dead ends: 1010 [2021-06-05 21:54:08,371 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 522.9ms TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:54:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-06-05 21:54:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 978. [2021-06-05 21:54:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 21:54:08,382 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 21:54:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:08,382 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 21:54:08,382 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 21:54:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:08,383 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:08,383 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:08,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5569,442 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:08,583 INFO L430 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 699355642, now seen corresponding path program 296 times [2021-06-05 21:54:08,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:08,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067126574] [2021-06-05 21:54:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:08,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:08,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067126574] [2021-06-05 21:54:08,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067126574] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:08,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902240167] [2021-06-05 21:54:08,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:08,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:08,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:08,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:08,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:08,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:08,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:08,955 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:08,956 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:08,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:08,959 INFO L388 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 11 [2021-06-05 21:54:08,959 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:08,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:08,987 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:08,987 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 21:54:09,042 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1143], 1=[array_4, v_prenex_1144]} [2021-06-05 21:54:09,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:09,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:09,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:54:09,049 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:09,101 INFO L628 ElimStorePlain]: treesize reduction 85, result has 41.4 percent of original size [2021-06-05 21:54:09,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:54:09,103 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:09,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:09,131 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:09,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:09,134 INFO L388 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 [2021-06-05 21:54:09,135 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:09,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:09,154 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:09,155 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 21:54:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:09,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902240167] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:09,227 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:09,227 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:54:09,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878855430] [2021-06-05 21:54:09,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:54:09,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:09,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:54:09,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:54:09,227 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:10,002 INFO L93 Difference]: Finished difference Result 1025 states and 3965 transitions. [2021-06-05 21:54:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:10,004 INFO L225 Difference]: With dead ends: 1025 [2021-06-05 21:54:10,004 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 21:54:10,004 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 823.4ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:54:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 21:54:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 975. [2021-06-05 21:54:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 3.935318275154004) internal successors, (3833), 974 states have internal predecessors, (3833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 3833 transitions. [2021-06-05 21:54:10,015 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 3833 transitions. Word has length 18 [2021-06-05 21:54:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:10,015 INFO L482 AbstractCegarLoop]: Abstraction has 975 states and 3833 transitions. [2021-06-05 21:54:10,015 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 3833 transitions. [2021-06-05 21:54:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:10,016 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:10,016 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:10,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 443 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5583 [2021-06-05 21:54:10,216 INFO L430 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:10,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1248272052, now seen corresponding path program 297 times [2021-06-05 21:54:10,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:10,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791322967] [2021-06-05 21:54:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:10,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:10,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791322967] [2021-06-05 21:54:10,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791322967] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:10,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966769373] [2021-06-05 21:54:10,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:10,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:54:10,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:10,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:10,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:10,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:10,626 INFO L388 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 11 [2021-06-05 21:54:10,627 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:10,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:10,630 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:10,631 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:10,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:10,634 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:10,635 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:10,638 INFO L388 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 12 [2021-06-05 21:54:10,639 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:10,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:10,695 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:10,696 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:141 [2021-06-05 21:54:10,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:10,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:10,887 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:10,888 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:10,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:10,891 INFO L388 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 35 treesize of output 27 [2021-06-05 21:54:10,892 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:10,918 INFO L628 ElimStorePlain]: treesize reduction 62, result has 36.7 percent of original size [2021-06-05 21:54:10,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:10,920 INFO L388 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 22 treesize of output 14 [2021-06-05 21:54:10,920 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:10,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:10,929 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1145 vanished before elimination [2021-06-05 21:54:10,929 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1146 vanished before elimination [2021-06-05 21:54:10,929 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:10,930 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:114, output treesize:16 [2021-06-05 21:54:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:10,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966769373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:10,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:10,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:54:10,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225381758] [2021-06-05 21:54:10,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:54:10,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:54:10,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:54:10,957 INFO L87 Difference]: Start difference. First operand 975 states and 3833 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:11,374 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-06-05 21:54:11,661 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2021-06-05 21:54:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:11,754 INFO L93 Difference]: Finished difference Result 1017 states and 3942 transitions. [2021-06-05 21:54:11,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:11,754 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:11,756 INFO L225 Difference]: With dead ends: 1017 [2021-06-05 21:54:11,756 INFO L226 Difference]: Without dead ends: 1012 [2021-06-05 21:54:11,756 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 964.2ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:54:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2021-06-05 21:54:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 981. [2021-06-05 21:54:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9357142857142855) internal successors, (3857), 980 states have internal predecessors, (3857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3857 transitions. [2021-06-05 21:54:11,766 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3857 transitions. Word has length 18 [2021-06-05 21:54:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:11,766 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3857 transitions. [2021-06-05 21:54:11,766 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3857 transitions. [2021-06-05 21:54:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:11,768 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:11,768 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:11,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 444 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5594 [2021-06-05 21:54:11,968 INFO L430 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash -691716694, now seen corresponding path program 298 times [2021-06-05 21:54:11,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:11,968 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819251463] [2021-06-05 21:54:11,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:12,274 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:12,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819251463] [2021-06-05 21:54:12,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819251463] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:12,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814864186] [2021-06-05 21:54:12,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:12,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:54:12,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:12,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:54:12,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:12,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,381 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:12,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:12,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,386 INFO L388 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 11 [2021-06-05 21:54:12,386 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:12,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,390 INFO L388 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 12 [2021-06-05 21:54:12,391 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:12,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,394 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:12,395 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:12,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:12,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:12,467 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:161 [2021-06-05 21:54:12,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,633 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:12,634 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:12,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,637 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:12,638 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:12,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,642 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:12,642 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:12,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,645 INFO L388 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 11 [2021-06-05 21:54:12,646 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:12,725 INFO L628 ElimStorePlain]: treesize reduction 107, result has 41.5 percent of original size [2021-06-05 21:54:12,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:12,728 INFO L388 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 [2021-06-05 21:54:12,730 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:12,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:12,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:12,764 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:209, output treesize:68 [2021-06-05 21:54:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:12,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814864186] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:12,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:12,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 21:54:12,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346110514] [2021-06-05 21:54:12,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:54:12,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:12,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:54:12,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:54:12,895 INFO L87 Difference]: Start difference. First operand 981 states and 3857 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:13,329 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-06-05 21:54:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:13,594 INFO L93 Difference]: Finished difference Result 1037 states and 4000 transitions. [2021-06-05 21:54:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:13,594 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:13,595 INFO L225 Difference]: With dead ends: 1037 [2021-06-05 21:54:13,596 INFO L226 Difference]: Without dead ends: 1022 [2021-06-05 21:54:13,596 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 915.3ms TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:54:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-06-05 21:54:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 981. [2021-06-05 21:54:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9326530612244897) internal successors, (3854), 980 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3854 transitions. [2021-06-05 21:54:13,606 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3854 transitions. Word has length 18 [2021-06-05 21:54:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:13,606 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3854 transitions. [2021-06-05 21:54:13,606 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3854 transitions. [2021-06-05 21:54:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:13,607 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:13,607 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:13,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 445 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5609 [2021-06-05 21:54:13,807 INFO L430 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1455365034, now seen corresponding path program 299 times [2021-06-05 21:54:13,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:13,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471530365] [2021-06-05 21:54:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:14,070 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:14,070 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471530365] [2021-06-05 21:54:14,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471530365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:14,070 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155151122] [2021-06-05 21:54:14,070 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:14,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:14,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:14,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:14,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:14,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,228 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:14,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,232 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:14,233 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,237 INFO L388 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 11 [2021-06-05 21:54:14,237 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,241 INFO L388 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 12 [2021-06-05 21:54:14,241 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:14,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:54:14,303 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:191, output treesize:155 [2021-06-05 21:54:14,494 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 21:54:14,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,498 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:14,499 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,502 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:14,503 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,507 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:14,508 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,511 INFO L388 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 11 [2021-06-05 21:54:14,511 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,574 INFO L628 ElimStorePlain]: treesize reduction 85, result has 45.2 percent of original size [2021-06-05 21:54:14,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:14,577 INFO L388 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 22 treesize of output 14 [2021-06-05 21:54:14,578 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:14,601 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:14,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:14,603 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:185, output treesize:44 [2021-06-05 21:54:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:14,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155151122] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:14,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:14,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:54:14,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115042460] [2021-06-05 21:54:14,676 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:54:14,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:54:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:54:14,677 INFO L87 Difference]: Start difference. First operand 981 states and 3854 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:14,990 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2021-06-05 21:54:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:15,285 INFO L93 Difference]: Finished difference Result 1024 states and 3980 transitions. [2021-06-05 21:54:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:15,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:15,287 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 21:54:15,287 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 21:54:15,287 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 741.7ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 21:54:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 980. [2021-06-05 21:54:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 21:54:15,298 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 21:54:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:15,298 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 21:54:15,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 21:54:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:15,299 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:15,299 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:15,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5625,446 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:15,499 INFO L430 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash 805372912, now seen corresponding path program 300 times [2021-06-05 21:54:15,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:15,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158670922] [2021-06-05 21:54:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:15,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:15,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158670922] [2021-06-05 21:54:15,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158670922] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:15,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413731129] [2021-06-05 21:54:15,907 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:15,935 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:54:15,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:15,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:15,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:16,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:16,029 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:16,030 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:16,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:16,033 INFO L388 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 11 [2021-06-05 21:54:16,034 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:16,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:16,037 INFO L388 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 12 [2021-06-05 21:54:16,038 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:16,040 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:16,041 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:16,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:16,079 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:16,079 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 21:54:16,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:16,199 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:16,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:16,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:16,202 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:16,203 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:16,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:16,206 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:16,207 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:16,209 INFO L388 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 11 [2021-06-05 21:54:16,210 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:16,249 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 21:54:16,251 INFO L388 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 [2021-06-05 21:54:16,252 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:16,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:16,268 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:16,268 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:54:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:16,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413731129] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:16,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:16,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:54:16,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683746049] [2021-06-05 21:54:16,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:54:16,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:54:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:54:16,330 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:16,827 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2021-06-05 21:54:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:17,473 INFO L93 Difference]: Finished difference Result 1038 states and 4005 transitions. [2021-06-05 21:54:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:54:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:17,475 INFO L225 Difference]: With dead ends: 1038 [2021-06-05 21:54:17,475 INFO L226 Difference]: Without dead ends: 1028 [2021-06-05 21:54:17,475 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1245.0ms TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:54:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-06-05 21:54:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 978. [2021-06-05 21:54:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 21:54:17,485 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 21:54:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:17,485 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 21:54:17,485 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 21:54:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:17,487 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:17,487 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:17,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5653,447 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:17,687 INFO L430 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash 126667614, now seen corresponding path program 301 times [2021-06-05 21:54:17,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:17,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577559755] [2021-06-05 21:54:17,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:18,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:18,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577559755] [2021-06-05 21:54:18,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577559755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:18,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059566768] [2021-06-05 21:54:18,431 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:18,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 21:54:18,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:18,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:18,573 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:18,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:18,577 INFO L388 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 12 [2021-06-05 21:54:18,578 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:18,581 INFO L388 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 11 [2021-06-05 21:54:18,581 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,584 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:18,585 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:18,631 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:18,631 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:119 [2021-06-05 21:54:18,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:18,773 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:18,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:18,777 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:18,778 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:18,780 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:18,781 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,783 INFO L388 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 11 [2021-06-05 21:54:18,784 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,823 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 21:54:18,825 INFO L388 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 22 treesize of output 14 [2021-06-05 21:54:18,826 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:18,841 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:18,841 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:18,842 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 21:54:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:18,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059566768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:18,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:18,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 21:54:18,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234677776] [2021-06-05 21:54:18,918 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 21:54:18,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:18,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 21:54:18,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:54:18,918 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:19,460 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 21:54:19,685 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-06-05 21:54:20,018 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-06-05 21:54:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:20,088 INFO L93 Difference]: Finished difference Result 1019 states and 3955 transitions. [2021-06-05 21:54:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:20,088 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:20,090 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 21:54:20,090 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 21:54:20,090 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1622.9ms TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:54:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 21:54:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 978. [2021-06-05 21:54:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 21:54:20,100 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 21:54:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:20,100 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 21:54:20,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 21:54:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:20,101 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:20,101 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:20,301 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5667,448 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:20,302 INFO L430 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -884569992, now seen corresponding path program 302 times [2021-06-05 21:54:20,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:20,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945480988] [2021-06-05 21:54:20,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:20,476 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2021-06-05 21:54:20,696 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2021-06-05 21:54:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:20,999 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:20,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945480988] [2021-06-05 21:54:20,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945480988] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:20,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737363979] [2021-06-05 21:54:20,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:21,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:21,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:21,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:21,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:21,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:21,155 INFO L388 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 11 [2021-06-05 21:54:21,155 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:21,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:21,159 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:21,159 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:21,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:21,163 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:21,163 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:21,166 INFO L388 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 12 [2021-06-05 21:54:21,167 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:21,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:21,224 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:21,224 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 21:54:21,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:21,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:21,433 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:21,434 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:21,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:21,436 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:21,437 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:21,462 INFO L628 ElimStorePlain]: treesize reduction 58, result has 34.1 percent of original size [2021-06-05 21:54:21,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:21,464 INFO L388 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 [2021-06-05 21:54:21,466 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:21,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:21,474 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:54:21,474 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:21,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:21,475 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 21:54:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:21,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737363979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:21,506 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:21,506 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2021-06-05 21:54:21,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084445956] [2021-06-05 21:54:21,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:21,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:21,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:21,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:21,507 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:21,890 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 43 [2021-06-05 21:54:22,151 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2021-06-05 21:54:22,449 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 58 [2021-06-05 21:54:22,808 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 65 [2021-06-05 21:54:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:22,954 INFO L93 Difference]: Finished difference Result 1068 states and 4102 transitions. [2021-06-05 21:54:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:54:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:22,956 INFO L225 Difference]: With dead ends: 1068 [2021-06-05 21:54:22,956 INFO L226 Difference]: Without dead ends: 1058 [2021-06-05 21:54:22,956 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1932.4ms TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:54:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2021-06-05 21:54:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 972. [2021-06-05 21:54:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.938208032955716) internal successors, (3824), 971 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3824 transitions. [2021-06-05 21:54:22,967 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3824 transitions. Word has length 18 [2021-06-05 21:54:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:22,967 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3824 transitions. [2021-06-05 21:54:22,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3824 transitions. [2021-06-05 21:54:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:22,968 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:22,968 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:23,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 449 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5682 [2021-06-05 21:54:23,168 INFO L430 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1041749102, now seen corresponding path program 303 times [2021-06-05 21:54:23,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:23,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967601845] [2021-06-05 21:54:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:23,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:23,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967601845] [2021-06-05 21:54:23,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967601845] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:23,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660104008] [2021-06-05 21:54:23,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:23,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:54:23,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:23,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:23,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:23,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:23,652 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:23,653 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:23,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:23,656 INFO L388 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 11 [2021-06-05 21:54:23,657 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:23,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:23,660 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:23,661 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:23,664 INFO L388 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 12 [2021-06-05 21:54:23,664 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:23,715 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:23,716 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:23,716 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 21:54:23,850 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1154], 1=[array_4, v_prenex_1155]} [2021-06-05 21:54:23,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:54:23,854 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:23,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:23,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:23,904 INFO L628 ElimStorePlain]: treesize reduction 83, result has 39.4 percent of original size [2021-06-05 21:54:23,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:54:23,908 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:23,924 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:23,924 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:23,926 INFO L388 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 [2021-06-05 21:54:23,928 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:23,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:23,944 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:23,944 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 21:54:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:24,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660104008] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:24,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:24,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 21:54:24,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22258804] [2021-06-05 21:54:24,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 21:54:24,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 21:54:24,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:54:24,017 INFO L87 Difference]: Start difference. First operand 972 states and 3824 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:24,574 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2021-06-05 21:54:24,743 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2021-06-05 21:54:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:25,132 INFO L93 Difference]: Finished difference Result 1048 states and 4045 transitions. [2021-06-05 21:54:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:25,134 INFO L225 Difference]: With dead ends: 1048 [2021-06-05 21:54:25,134 INFO L226 Difference]: Without dead ends: 1038 [2021-06-05 21:54:25,134 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1265.2ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:54:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-06-05 21:54:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 972. [2021-06-05 21:54:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.938208032955716) internal successors, (3824), 971 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3824 transitions. [2021-06-05 21:54:25,145 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3824 transitions. Word has length 18 [2021-06-05 21:54:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:25,145 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3824 transitions. [2021-06-05 21:54:25,145 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3824 transitions. [2021-06-05 21:54:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:25,146 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:25,146 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:25,346 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5697,450 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:25,346 INFO L430 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1952554566, now seen corresponding path program 304 times [2021-06-05 21:54:25,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:25,347 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953663209] [2021-06-05 21:54:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:25,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:25,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953663209] [2021-06-05 21:54:25,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953663209] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:25,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283883734] [2021-06-05 21:54:25,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:25,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:54:25,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:25,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 21:54:25,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:25,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:25,966 INFO L388 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 11 [2021-06-05 21:54:25,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:25,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:25,969 INFO L388 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 12 [2021-06-05 21:54:25,970 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:25,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:25,973 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:25,974 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:25,976 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:25,977 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:26,015 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:26,016 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:26,016 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:93 [2021-06-05 21:54:26,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:26,188 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:26,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:26,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:26,192 INFO L388 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 27 treesize of output 21 [2021-06-05 21:54:26,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:26,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:26,196 INFO L388 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 11 [2021-06-05 21:54:26,197 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:26,200 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:26,200 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:26,262 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 21:54:26,265 INFO L388 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 22 treesize of output 14 [2021-06-05 21:54:26,266 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:26,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:26,291 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:26,291 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 21:54:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:26,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283883734] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:26,430 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:26,430 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 21:54:26,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082268584] [2021-06-05 21:54:26,430 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 21:54:26,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:26,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 21:54:26,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:54:26,431 INFO L87 Difference]: Start difference. First operand 972 states and 3824 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:26,928 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 21:54:27,097 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2021-06-05 21:54:27,297 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2021-06-05 21:54:27,508 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2021-06-05 21:54:27,714 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2021-06-05 21:54:27,898 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2021-06-05 21:54:28,065 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2021-06-05 21:54:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:28,310 INFO L93 Difference]: Finished difference Result 1278 states and 4854 transitions. [2021-06-05 21:54:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 21:54:28,310 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:28,312 INFO L225 Difference]: With dead ends: 1278 [2021-06-05 21:54:28,312 INFO L226 Difference]: Without dead ends: 1256 [2021-06-05 21:54:28,312 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2162.8ms TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 21:54:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2021-06-05 21:54:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 984. [2021-06-05 21:54:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9389623601220753) internal successors, (3872), 983 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3872 transitions. [2021-06-05 21:54:28,324 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3872 transitions. Word has length 18 [2021-06-05 21:54:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:28,324 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3872 transitions. [2021-06-05 21:54:28,324 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3872 transitions. [2021-06-05 21:54:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:28,325 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:28,325 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:28,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5712,451 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:28,526 INFO L430 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash -677605888, now seen corresponding path program 305 times [2021-06-05 21:54:28,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:28,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519684233] [2021-06-05 21:54:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:28,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:28,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519684233] [2021-06-05 21:54:28,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519684233] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:28,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460835085] [2021-06-05 21:54:28,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:28,890 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:54:28,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:28,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:28,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:28,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:28,967 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:28,968 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:28,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:28,970 INFO L388 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 11 [2021-06-05 21:54:28,971 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:28,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:28,974 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:28,974 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:28,976 INFO L388 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 12 [2021-06-05 21:54:28,977 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:29,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:29,003 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:29,004 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 21:54:29,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:29,151 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:29,151 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:29,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:29,154 INFO L388 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 35 treesize of output 27 [2021-06-05 21:54:29,155 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:29,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:29,158 INFO L388 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 11 [2021-06-05 21:54:29,158 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:29,161 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:29,162 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:29,201 INFO L628 ElimStorePlain]: treesize reduction 70, result has 38.1 percent of original size [2021-06-05 21:54:29,203 INFO L388 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 [2021-06-05 21:54:29,204 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 21:54:29,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:29,220 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:29,220 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 21:54:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:29,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460835085] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:29,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:29,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:29,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224497347] [2021-06-05 21:54:29,288 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:29,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:29,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:29,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:29,288 INFO L87 Difference]: Start difference. First operand 984 states and 3872 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:29,823 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-06-05 21:54:30,300 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2021-06-05 21:54:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:30,369 INFO L93 Difference]: Finished difference Result 1164 states and 4532 transitions. [2021-06-05 21:54:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:30,371 INFO L225 Difference]: With dead ends: 1164 [2021-06-05 21:54:30,371 INFO L226 Difference]: Without dead ends: 1159 [2021-06-05 21:54:30,371 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1177.2ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:54:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-06-05 21:54:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 982. [2021-06-05 21:54:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.9429153924566767) internal successors, (3868), 981 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3868 transitions. [2021-06-05 21:54:30,382 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3868 transitions. Word has length 18 [2021-06-05 21:54:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:30,383 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3868 transitions. [2021-06-05 21:54:30,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3868 transitions. [2021-06-05 21:54:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:30,384 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:30,384 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:30,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 452 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5725 [2021-06-05 21:54:30,584 INFO L430 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1248428190, now seen corresponding path program 306 times [2021-06-05 21:54:30,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:30,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482245361] [2021-06-05 21:54:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:30,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:30,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482245361] [2021-06-05 21:54:30,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482245361] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:30,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945233774] [2021-06-05 21:54:30,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:30,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:54:30,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:30,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:30,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:30,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:30,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:30,951 INFO L388 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 12 [2021-06-05 21:54:30,952 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:30,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:30,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:30,955 INFO L388 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 11 [2021-06-05 21:54:30,956 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:30,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:30,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:30,960 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:30,960 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:30,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:30,964 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:30,964 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:31,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:31,023 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:54:31,023 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 21:54:31,173 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1156], 1=[array_4, v_prenex_1157]} [2021-06-05 21:54:31,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:31,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:31,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 21:54:31,180 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:31,233 INFO L628 ElimStorePlain]: treesize reduction 81, result has 42.6 percent of original size [2021-06-05 21:54:31,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 21:54:31,236 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:31,255 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:31,255 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:31,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:31,257 INFO L388 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 22 treesize of output 14 [2021-06-05 21:54:31,258 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:31,276 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:31,277 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:31,277 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 21:54:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:31,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945233774] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:31,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:31,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:54:31,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612626395] [2021-06-05 21:54:31,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:54:31,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:54:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:54:31,354 INFO L87 Difference]: Start difference. First operand 982 states and 3868 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:31,835 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-06-05 21:54:32,294 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-06-05 21:54:32,419 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-06-05 21:54:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:32,496 INFO L93 Difference]: Finished difference Result 1157 states and 4510 transitions. [2021-06-05 21:54:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:32,499 INFO L225 Difference]: With dead ends: 1157 [2021-06-05 21:54:32,499 INFO L226 Difference]: Without dead ends: 1147 [2021-06-05 21:54:32,499 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1196.4ms TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:54:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-06-05 21:54:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 981. [2021-06-05 21:54:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9448979591836735) internal successors, (3866), 980 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3866 transitions. [2021-06-05 21:54:32,510 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3866 transitions. Word has length 18 [2021-06-05 21:54:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:32,510 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3866 transitions. [2021-06-05 21:54:32,510 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3866 transitions. [2021-06-05 21:54:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 21:54:32,511 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:32,511 INFO L554 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:32,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5739,453 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:32,711 INFO L430 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:32,712 INFO L82 PathProgramCache]: Analyzing trace with hash -19028988, now seen corresponding path program 307 times [2021-06-05 21:54:32,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:32,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733609901] [2021-06-05 21:54:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:32,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:32,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733609901] [2021-06-05 21:54:32,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733609901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:32,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98750345] [2021-06-05 21:54:32,920 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:32,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 21:54:32,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:33,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,094 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:33,095 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,099 INFO L388 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 11 [2021-06-05 21:54:33,100 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,104 INFO L388 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 12 [2021-06-05 21:54:33,104 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,108 INFO L388 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 26 treesize of output 20 [2021-06-05 21:54:33,109 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:33,165 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 21:54:33,165 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:167, output treesize:135 [2021-06-05 21:54:33,339 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 21:54:33,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,343 INFO L388 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 35 treesize of output 27 [2021-06-05 21:54:33,344 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,347 INFO L388 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 11 [2021-06-05 21:54:33,348 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,351 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:33,352 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,355 INFO L388 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 25 treesize of output 19 [2021-06-05 21:54:33,356 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,407 INFO L628 ElimStorePlain]: treesize reduction 76, result has 44.5 percent of original size [2021-06-05 21:54:33,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:33,409 INFO L388 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 22 treesize of output 14 [2021-06-05 21:54:33,410 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:33,430 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:33,432 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:33,432 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 21:54:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:33,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98750345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:33,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:33,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:54:33,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363543221] [2021-06-05 21:54:33,500 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:54:33,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:54:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:54:33,501 INFO L87 Difference]: Start difference. First operand 981 states and 3866 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:33,994 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2021-06-05 21:54:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:34,467 INFO L93 Difference]: Finished difference Result 1160 states and 4546 transitions. [2021-06-05 21:54:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:34,467 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 21:54:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:34,469 INFO L225 Difference]: With dead ends: 1160 [2021-06-05 21:54:34,469 INFO L226 Difference]: Without dead ends: 1155 [2021-06-05 21:54:34,469 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 925.0ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:54:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2021-06-05 21:54:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 975. [2021-06-05 21:54:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 3.9507186858316223) internal successors, (3848), 974 states have internal predecessors, (3848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 3848 transitions. [2021-06-05 21:54:34,480 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 3848 transitions. Word has length 18 [2021-06-05 21:54:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:34,480 INFO L482 AbstractCegarLoop]: Abstraction has 975 states and 3848 transitions. [2021-06-05 21:54:34,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 3848 transitions. [2021-06-05 21:54:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:34,481 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:34,481 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:34,682 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5754,454 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:34,682 INFO L430 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1736350512, now seen corresponding path program 308 times [2021-06-05 21:54:34,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:34,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132356956] [2021-06-05 21:54:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:34,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:34,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132356956] [2021-06-05 21:54:34,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132356956] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:34,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340252945] [2021-06-05 21:54:34,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:34,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:34,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:34,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:34,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:34,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:34,888 INFO L388 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 12 [2021-06-05 21:54:34,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:34,891 INFO L388 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 11 [2021-06-05 21:54:34,892 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:34,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:34,905 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:34,905 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:54:34,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:34,973 INFO L388 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 11 [2021-06-05 21:54:34,974 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:34,976 INFO L388 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 12 [2021-06-05 21:54:34,976 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:34,991 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:54:34,991 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:34,991 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:54:34,991 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:54:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:35,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340252945] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:35,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:35,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:35,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671255166] [2021-06-05 21:54:35,012 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:35,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:35,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:35,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:35,013 INFO L87 Difference]: Start difference. First operand 975 states and 3848 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:35,461 INFO L93 Difference]: Finished difference Result 1265 states and 4852 transitions. [2021-06-05 21:54:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:35,464 INFO L225 Difference]: With dead ends: 1265 [2021-06-05 21:54:35,464 INFO L226 Difference]: Without dead ends: 1265 [2021-06-05 21:54:35,464 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 330.8ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:54:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-06-05 21:54:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 988. [2021-06-05 21:54:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 3.951367781155015) internal successors, (3900), 987 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 3900 transitions. [2021-06-05 21:54:35,476 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 3900 transitions. Word has length 19 [2021-06-05 21:54:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:35,476 INFO L482 AbstractCegarLoop]: Abstraction has 988 states and 3900 transitions. [2021-06-05 21:54:35,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 3900 transitions. [2021-06-05 21:54:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:35,477 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:35,477 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:35,678 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 455 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5771 [2021-06-05 21:54:35,678 INFO L430 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1780604390, now seen corresponding path program 309 times [2021-06-05 21:54:35,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:35,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438138799] [2021-06-05 21:54:35,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:35,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:35,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438138799] [2021-06-05 21:54:35,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438138799] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:35,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974232679] [2021-06-05 21:54:35,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:35,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:54:35,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:35,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:35,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:35,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:35,831 INFO L388 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 12 [2021-06-05 21:54:35,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:35,833 INFO L388 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 11 [2021-06-05 21:54:35,834 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:35,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:35,847 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:35,847 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:54:35,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:35,896 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:35,897 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:35,898 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:54:35,899 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:35,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:54:35,902 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:35,903 INFO L388 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 12 [2021-06-05 21:54:35,904 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:35,919 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 21:54:35,919 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:35,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:35,919 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:54:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:35,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974232679] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:35,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:35,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-06-05 21:54:35,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699161801] [2021-06-05 21:54:35,939 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:54:35,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:35,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:54:35,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:54:35,939 INFO L87 Difference]: Start difference. First operand 988 states and 3900 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:36,280 INFO L93 Difference]: Finished difference Result 1177 states and 4540 transitions. [2021-06-05 21:54:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:36,282 INFO L225 Difference]: With dead ends: 1177 [2021-06-05 21:54:36,282 INFO L226 Difference]: Without dead ends: 1163 [2021-06-05 21:54:36,282 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 320.1ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2021-06-05 21:54:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 988. [2021-06-05 21:54:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 3.9463019250253293) internal successors, (3895), 987 states have internal predecessors, (3895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 3895 transitions. [2021-06-05 21:54:36,293 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 3895 transitions. Word has length 19 [2021-06-05 21:54:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:36,293 INFO L482 AbstractCegarLoop]: Abstraction has 988 states and 3895 transitions. [2021-06-05 21:54:36,293 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 3895 transitions. [2021-06-05 21:54:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:36,294 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:36,295 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:36,495 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5774,456 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:36,495 INFO L430 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash 609550430, now seen corresponding path program 310 times [2021-06-05 21:54:36,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:36,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574452319] [2021-06-05 21:54:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:36,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:36,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574452319] [2021-06-05 21:54:36,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574452319] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:36,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725267448] [2021-06-05 21:54:36,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:36,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:54:36,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:36,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:36,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:36,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:36,708 INFO L388 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 12 [2021-06-05 21:54:36,709 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:36,711 INFO L388 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 11 [2021-06-05 21:54:36,712 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:36,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:36,725 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:36,725 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:54:36,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:36,816 INFO L388 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 11 [2021-06-05 21:54:36,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:36,818 INFO L388 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 12 [2021-06-05 21:54:36,819 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:36,834 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:54:36,834 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:36,835 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:54:36,835 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:54:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:36,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725267448] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:36,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:36,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:36,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662354962] [2021-06-05 21:54:36,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:36,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:36,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:36,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:36,856 INFO L87 Difference]: Start difference. First operand 988 states and 3895 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:37,299 INFO L93 Difference]: Finished difference Result 1184 states and 4571 transitions. [2021-06-05 21:54:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:37,299 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:37,301 INFO L225 Difference]: With dead ends: 1184 [2021-06-05 21:54:37,301 INFO L226 Difference]: Without dead ends: 1184 [2021-06-05 21:54:37,301 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 366.0ms TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:54:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2021-06-05 21:54:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 991. [2021-06-05 21:54:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 3.9464646464646465) internal successors, (3907), 990 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 3907 transitions. [2021-06-05 21:54:37,312 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 3907 transitions. Word has length 19 [2021-06-05 21:54:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:37,312 INFO L482 AbstractCegarLoop]: Abstraction has 991 states and 3907 transitions. [2021-06-05 21:54:37,312 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 3907 transitions. [2021-06-05 21:54:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:37,314 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:37,314 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:37,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 457 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5780 [2021-06-05 21:54:37,514 INFO L430 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:37,514 INFO L82 PathProgramCache]: Analyzing trace with hash -999033840, now seen corresponding path program 311 times [2021-06-05 21:54:37,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:37,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883757180] [2021-06-05 21:54:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:37,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:37,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883757180] [2021-06-05 21:54:37,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883757180] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:37,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293308059] [2021-06-05 21:54:37,588 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:37,617 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:37,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:37,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:37,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:37,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:37,666 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:37,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:37,669 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:37,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:37,683 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:37,683 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 21:54:37,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:37,760 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:37,761 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:37,763 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:54:37,763 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:37,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:54:37,766 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:37,767 INFO L388 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 12 [2021-06-05 21:54:37,768 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:37,783 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 21:54:37,783 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:37,783 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:37,783 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:54:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:37,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293308059] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:37,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:37,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:37,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485974836] [2021-06-05 21:54:37,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:37,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:37,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:37,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:37,804 INFO L87 Difference]: Start difference. First operand 991 states and 3907 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:38,191 INFO L93 Difference]: Finished difference Result 1189 states and 4580 transitions. [2021-06-05 21:54:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:38,193 INFO L225 Difference]: With dead ends: 1189 [2021-06-05 21:54:38,193 INFO L226 Difference]: Without dead ends: 1181 [2021-06-05 21:54:38,193 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 363.4ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:54:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2021-06-05 21:54:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 991. [2021-06-05 21:54:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 3.9434343434343435) internal successors, (3904), 990 states have internal predecessors, (3904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 3904 transitions. [2021-06-05 21:54:38,204 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 3904 transitions. Word has length 19 [2021-06-05 21:54:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:38,205 INFO L482 AbstractCegarLoop]: Abstraction has 991 states and 3904 transitions. [2021-06-05 21:54:38,205 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 3904 transitions. [2021-06-05 21:54:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:38,206 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:38,206 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:38,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 458 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5783 [2021-06-05 21:54:38,406 INFO L430 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2090788300, now seen corresponding path program 312 times [2021-06-05 21:54:38,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:38,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330865500] [2021-06-05 21:54:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:38,523 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:38,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330865500] [2021-06-05 21:54:38,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330865500] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:38,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120093235] [2021-06-05 21:54:38,523 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:38,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:54:38,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:38,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:38,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:38,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:38,623 INFO L388 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 12 [2021-06-05 21:54:38,624 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:38,633 INFO L388 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 11 [2021-06-05 21:54:38,634 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:38,652 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:38,653 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:38,653 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:54:38,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:38,743 INFO L388 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 11 [2021-06-05 21:54:38,744 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:38,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:38,746 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:38,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:38,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:38,750 INFO L388 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 12 [2021-06-05 21:54:38,750 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:38,752 INFO L388 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 12 [2021-06-05 21:54:38,753 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:38,786 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:38,786 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:38,787 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:38,787 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:38,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120093235] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:38,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:38,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:38,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998217834] [2021-06-05 21:54:38,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:38,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:38,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:38,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:38,840 INFO L87 Difference]: Start difference. First operand 991 states and 3904 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:39,502 INFO L93 Difference]: Finished difference Result 1217 states and 4654 transitions. [2021-06-05 21:54:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:54:39,503 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:39,504 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 21:54:39,505 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 21:54:39,505 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 580.7ms TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:54:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 21:54:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 994. [2021-06-05 21:54:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.9466263846928498) internal successors, (3919), 993 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3919 transitions. [2021-06-05 21:54:39,516 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 3919 transitions. Word has length 19 [2021-06-05 21:54:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:39,516 INFO L482 AbstractCegarLoop]: Abstraction has 994 states and 3919 transitions. [2021-06-05 21:54:39,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 3919 transitions. [2021-06-05 21:54:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:39,517 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:39,517 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:39,718 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5789,459 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:39,718 INFO L430 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1009142822, now seen corresponding path program 313 times [2021-06-05 21:54:39,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:39,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618174030] [2021-06-05 21:54:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:39,804 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:39,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618174030] [2021-06-05 21:54:39,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618174030] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:39,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362256418] [2021-06-05 21:54:39,804 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:39,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:39,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:39,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:39,881 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:39,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:39,883 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:39,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:39,897 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:39,897 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 21:54:39,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:39,958 INFO L388 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 12 [2021-06-05 21:54:39,959 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:39,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:39,962 INFO L388 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 11 [2021-06-05 21:54:39,962 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:39,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:39,965 INFO L388 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 12 [2021-06-05 21:54:39,965 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:39,967 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:39,968 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:40,003 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:54:40,003 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:40,004 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:40,004 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:54:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:40,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362256418] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:40,063 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:40,063 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:40,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134828150] [2021-06-05 21:54:40,063 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:40,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:40,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:40,064 INFO L87 Difference]: Start difference. First operand 994 states and 3919 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:40,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:40,694 INFO L93 Difference]: Finished difference Result 1208 states and 4629 transitions. [2021-06-05 21:54:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:54:40,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:40,696 INFO L225 Difference]: With dead ends: 1208 [2021-06-05 21:54:40,696 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 21:54:40,696 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 556.3ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:54:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 21:54:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 998. [2021-06-05 21:54:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 3.945837512537613) internal successors, (3934), 997 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 3934 transitions. [2021-06-05 21:54:40,707 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 3934 transitions. Word has length 19 [2021-06-05 21:54:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:40,707 INFO L482 AbstractCegarLoop]: Abstraction has 998 states and 3934 transitions. [2021-06-05 21:54:40,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 3934 transitions. [2021-06-05 21:54:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:40,708 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:40,709 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:40,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 460 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5794 [2021-06-05 21:54:40,909 INFO L430 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash 419812284, now seen corresponding path program 314 times [2021-06-05 21:54:40,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:40,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361652906] [2021-06-05 21:54:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:41,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:41,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361652906] [2021-06-05 21:54:41,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361652906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:41,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406643598] [2021-06-05 21:54:41,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:41,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:41,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:41,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:41,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:41,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:41,121 INFO L388 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 12 [2021-06-05 21:54:41,122 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:41,123 INFO L388 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 11 [2021-06-05 21:54:41,124 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:41,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:41,137 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:41,137 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:54:41,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:41,200 INFO L388 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 11 [2021-06-05 21:54:41,201 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:41,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:41,203 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:41,204 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:41,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:41,207 INFO L388 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 12 [2021-06-05 21:54:41,207 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:41,209 INFO L388 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 12 [2021-06-05 21:54:41,210 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:41,243 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:41,243 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:41,244 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:41,244 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:41,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406643598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:41,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:41,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:41,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382259026] [2021-06-05 21:54:41,306 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:41,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:41,306 INFO L87 Difference]: Start difference. First operand 998 states and 3934 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:41,943 INFO L93 Difference]: Finished difference Result 1200 states and 4622 transitions. [2021-06-05 21:54:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:54:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:41,945 INFO L225 Difference]: With dead ends: 1200 [2021-06-05 21:54:41,945 INFO L226 Difference]: Without dead ends: 1197 [2021-06-05 21:54:41,945 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 574.0ms TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:54:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2021-06-05 21:54:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 998. [2021-06-05 21:54:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 3.9428284854563693) internal successors, (3931), 997 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 3931 transitions. [2021-06-05 21:54:41,956 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 3931 transitions. Word has length 19 [2021-06-05 21:54:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:41,956 INFO L482 AbstractCegarLoop]: Abstraction has 998 states and 3931 transitions. [2021-06-05 21:54:41,956 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 3931 transitions. [2021-06-05 21:54:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:41,958 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:41,958 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:42,158 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5801,461 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:42,158 INFO L430 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:42,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:42,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1345835728, now seen corresponding path program 315 times [2021-06-05 21:54:42,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:42,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465962061] [2021-06-05 21:54:42,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:42,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:42,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465962061] [2021-06-05 21:54:42,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465962061] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:42,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81772104] [2021-06-05 21:54:42,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:42,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:54:42,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:42,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:42,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:42,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:42,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:42,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:42,324 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:42,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:42,338 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:42,338 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 21:54:42,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:42,400 INFO L388 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 12 [2021-06-05 21:54:42,400 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:42,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:42,403 INFO L388 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 11 [2021-06-05 21:54:42,404 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:42,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:42,406 INFO L388 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 12 [2021-06-05 21:54:42,407 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:42,409 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:42,410 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:42,444 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:54:42,444 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:42,445 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:42,445 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:54:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:42,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81772104] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:42,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:42,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:42,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054765909] [2021-06-05 21:54:42,493 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:42,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:42,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:42,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:42,493 INFO L87 Difference]: Start difference. First operand 998 states and 3931 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:42,960 INFO L93 Difference]: Finished difference Result 1190 states and 4592 transitions. [2021-06-05 21:54:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:54:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:42,962 INFO L225 Difference]: With dead ends: 1190 [2021-06-05 21:54:42,962 INFO L226 Difference]: Without dead ends: 1190 [2021-06-05 21:54:42,963 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 431.9ms TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:54:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2021-06-05 21:54:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 994. [2021-06-05 21:54:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.9405840886203425) internal successors, (3913), 993 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3913 transitions. [2021-06-05 21:54:42,974 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 3913 transitions. Word has length 19 [2021-06-05 21:54:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:42,974 INFO L482 AbstractCegarLoop]: Abstraction has 994 states and 3913 transitions. [2021-06-05 21:54:42,974 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 3913 transitions. [2021-06-05 21:54:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:42,975 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:42,975 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:43,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 462 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5808 [2021-06-05 21:54:43,175 INFO L430 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash -463534950, now seen corresponding path program 316 times [2021-06-05 21:54:43,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:43,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383887649] [2021-06-05 21:54:43,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:43,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:43,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383887649] [2021-06-05 21:54:43,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383887649] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:43,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300058221] [2021-06-05 21:54:43,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:43,312 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:54:43,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:43,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:43,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:43,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:43,403 INFO L388 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 11 [2021-06-05 21:54:43,404 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:43,406 INFO L388 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 12 [2021-06-05 21:54:43,407 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:43,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:43,423 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:43,423 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:43,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:43,479 INFO L388 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 11 [2021-06-05 21:54:43,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:43,482 INFO L388 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 12 [2021-06-05 21:54:43,482 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:43,497 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:54:43,497 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:43,497 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:54:43,497 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:54:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:43,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300058221] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:43,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:43,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:43,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248358897] [2021-06-05 21:54:43,518 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:43,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:43,518 INFO L87 Difference]: Start difference. First operand 994 states and 3913 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:43,886 INFO L93 Difference]: Finished difference Result 1097 states and 4258 transitions. [2021-06-05 21:54:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:43,886 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:43,888 INFO L225 Difference]: With dead ends: 1097 [2021-06-05 21:54:43,888 INFO L226 Difference]: Without dead ends: 1097 [2021-06-05 21:54:43,888 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 324.5ms TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:54:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-06-05 21:54:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1000. [2021-06-05 21:54:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.937937937937938) internal successors, (3934), 999 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3934 transitions. [2021-06-05 21:54:43,899 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3934 transitions. Word has length 19 [2021-06-05 21:54:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:43,899 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3934 transitions. [2021-06-05 21:54:43,899 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3934 transitions. [2021-06-05 21:54:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:43,900 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:43,900 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:44,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5813,463 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:44,101 INFO L430 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:44,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2072119220, now seen corresponding path program 317 times [2021-06-05 21:54:44,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:44,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115473187] [2021-06-05 21:54:44,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:44,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:44,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115473187] [2021-06-05 21:54:44,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115473187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:44,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414440860] [2021-06-05 21:54:44,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:44,200 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:44,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:44,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:44,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:44,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:44,263 INFO L388 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 11 [2021-06-05 21:54:44,264 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:44,266 INFO L388 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 12 [2021-06-05 21:54:44,267 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:44,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:44,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:44,283 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:44,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:44,347 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:44,348 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:44,350 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:54:44,350 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:44,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:54:44,353 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:44,354 INFO L388 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 12 [2021-06-05 21:54:44,355 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:44,370 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 21:54:44,370 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:44,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:44,370 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:54:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:44,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414440860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:44,390 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:44,390 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:44,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788847145] [2021-06-05 21:54:44,390 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:44,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:44,391 INFO L87 Difference]: Start difference. First operand 1000 states and 3934 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:44,716 INFO L93 Difference]: Finished difference Result 1087 states and 4222 transitions. [2021-06-05 21:54:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:44,718 INFO L225 Difference]: With dead ends: 1087 [2021-06-05 21:54:44,718 INFO L226 Difference]: Without dead ends: 1079 [2021-06-05 21:54:44,718 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 264.3ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:54:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-06-05 21:54:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1000. [2021-06-05 21:54:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.934934934934935) internal successors, (3931), 999 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3931 transitions. [2021-06-05 21:54:44,729 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3931 transitions. Word has length 19 [2021-06-05 21:54:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:44,729 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3931 transitions. [2021-06-05 21:54:44,729 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3931 transitions. [2021-06-05 21:54:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:44,730 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:44,730 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:44,931 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 464 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5816 [2021-06-05 21:54:44,931 INFO L430 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:44,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1017702920, now seen corresponding path program 318 times [2021-06-05 21:54:44,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:44,931 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004052598] [2021-06-05 21:54:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:45,057 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:45,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004052598] [2021-06-05 21:54:45,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004052598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:45,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913251793] [2021-06-05 21:54:45,058 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:45,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:54:45,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:45,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:45,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:45,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:45,176 INFO L388 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 11 [2021-06-05 21:54:45,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:45,178 INFO L388 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 12 [2021-06-05 21:54:45,179 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:45,194 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:45,195 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:45,195 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:45,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:45,235 INFO L388 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 11 [2021-06-05 21:54:45,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:45,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:45,238 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:45,239 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:45,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:45,241 INFO L388 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 12 [2021-06-05 21:54:45,242 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:45,244 INFO L388 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 12 [2021-06-05 21:54:45,244 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:45,277 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:45,278 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:45,278 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:45,278 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:45,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913251793] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:45,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:45,331 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:45,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952120403] [2021-06-05 21:54:45,331 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:45,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:45,332 INFO L87 Difference]: Start difference. First operand 1000 states and 3931 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:45,849 INFO L93 Difference]: Finished difference Result 1096 states and 4256 transitions. [2021-06-05 21:54:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:45,851 INFO L225 Difference]: With dead ends: 1096 [2021-06-05 21:54:45,851 INFO L226 Difference]: Without dead ends: 1096 [2021-06-05 21:54:45,851 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 463.2ms TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:54:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2021-06-05 21:54:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1003. [2021-06-05 21:54:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.932135728542914) internal successors, (3940), 1002 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3940 transitions. [2021-06-05 21:54:45,862 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3940 transitions. Word has length 19 [2021-06-05 21:54:45,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:45,862 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3940 transitions. [2021-06-05 21:54:45,862 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3940 transitions. [2021-06-05 21:54:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:45,863 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:45,863 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:46,063 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5823,465 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:46,064 INFO L430 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:46,064 INFO L82 PathProgramCache]: Analyzing trace with hash 272750348, now seen corresponding path program 319 times [2021-06-05 21:54:46,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:46,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515825290] [2021-06-05 21:54:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:46,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:46,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515825290] [2021-06-05 21:54:46,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515825290] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:46,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106688977] [2021-06-05 21:54:46,151 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:46,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:46,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:46,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:46,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:46,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:46,245 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:46,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:46,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:46,262 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 21:54:46,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:46,301 INFO L388 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 12 [2021-06-05 21:54:46,301 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:46,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:46,304 INFO L388 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 12 [2021-06-05 21:54:46,305 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:46,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:46,307 INFO L388 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 11 [2021-06-05 21:54:46,308 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:46,310 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:46,311 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:46,346 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:54:46,346 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:46,346 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:46,346 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:54:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:46,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106688977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:46,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:46,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:46,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023554315] [2021-06-05 21:54:46,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:46,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:46,394 INFO L87 Difference]: Start difference. First operand 1003 states and 3940 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:46,709 INFO L93 Difference]: Finished difference Result 1088 states and 4234 transitions. [2021-06-05 21:54:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:46,711 INFO L225 Difference]: With dead ends: 1088 [2021-06-05 21:54:46,711 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 21:54:46,711 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 294.7ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:54:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 21:54:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 997. [2021-06-05 21:54:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 3.9377510040160644) internal successors, (3922), 996 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 3922 transitions. [2021-06-05 21:54:46,722 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 3922 transitions. Word has length 19 [2021-06-05 21:54:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:46,722 INFO L482 AbstractCegarLoop]: Abstraction has 997 states and 3922 transitions. [2021-06-05 21:54:46,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 3922 transitions. [2021-06-05 21:54:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:46,723 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:46,723 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:46,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 466 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5828 [2021-06-05 21:54:46,924 INFO L430 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:46,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -298454384, now seen corresponding path program 320 times [2021-06-05 21:54:46,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:46,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064339085] [2021-06-05 21:54:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:47,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:47,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064339085] [2021-06-05 21:54:47,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064339085] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:47,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464880740] [2021-06-05 21:54:47,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:47,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:47,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:47,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:47,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:47,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:47,163 INFO L388 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 11 [2021-06-05 21:54:47,164 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:47,166 INFO L388 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 12 [2021-06-05 21:54:47,166 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:47,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:47,183 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:47,183 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:47,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:47,232 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:47,233 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:47,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:47,236 INFO L388 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 12 [2021-06-05 21:54:47,236 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:47,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:47,239 INFO L388 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 12 [2021-06-05 21:54:47,239 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:47,241 INFO L388 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 11 [2021-06-05 21:54:47,242 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:47,275 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:47,276 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:47,276 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:47,276 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:47,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464880740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:47,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:47,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:47,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556084931] [2021-06-05 21:54:47,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:47,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:47,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:47,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:47,330 INFO L87 Difference]: Start difference. First operand 997 states and 3922 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:47,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:47,865 INFO L93 Difference]: Finished difference Result 1119 states and 4310 transitions. [2021-06-05 21:54:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:47,865 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:47,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:47,867 INFO L225 Difference]: With dead ends: 1119 [2021-06-05 21:54:47,867 INFO L226 Difference]: Without dead ends: 1119 [2021-06-05 21:54:47,867 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 442.7ms TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:54:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2021-06-05 21:54:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1003. [2021-06-05 21:54:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.9411177644710578) internal successors, (3949), 1002 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3949 transitions. [2021-06-05 21:54:47,878 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3949 transitions. Word has length 19 [2021-06-05 21:54:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:47,878 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3949 transitions. [2021-06-05 21:54:47,878 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3949 transitions. [2021-06-05 21:54:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:47,880 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:47,880 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:48,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5833,467 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:48,080 INFO L430 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash 896581790, now seen corresponding path program 321 times [2021-06-05 21:54:48,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:48,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192942146] [2021-06-05 21:54:48,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:48,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:48,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192942146] [2021-06-05 21:54:48,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192942146] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:48,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476112140] [2021-06-05 21:54:48,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:48,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:54:48,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:48,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:48,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:48,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:48,253 INFO L388 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 18 treesize of output 14 [2021-06-05 21:54:48,254 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:48,255 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:48,256 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:48,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:48,274 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:48,274 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 21:54:48,310 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 21:54:48,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:48,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:48,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:48,317 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:48,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:54:48,320 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:48,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:48,322 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:48,376 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:54:48,376 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:48,377 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:48,377 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:54:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:48,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476112140] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:48,437 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:48,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:48,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195591191] [2021-06-05 21:54:48,437 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:48,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:48,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:48,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:48,437 INFO L87 Difference]: Start difference. First operand 1003 states and 3949 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:48,801 INFO L93 Difference]: Finished difference Result 1109 states and 4280 transitions. [2021-06-05 21:54:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:54:48,802 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:48,804 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 21:54:48,804 INFO L226 Difference]: Without dead ends: 1105 [2021-06-05 21:54:48,804 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 344.4ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:54:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2021-06-05 21:54:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1007. [2021-06-05 21:54:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9403578528827037) internal successors, (3964), 1006 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3964 transitions. [2021-06-05 21:54:48,815 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3964 transitions. Word has length 19 [2021-06-05 21:54:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:48,815 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3964 transitions. [2021-06-05 21:54:48,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3964 transitions. [2021-06-05 21:54:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:48,816 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:48,816 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:49,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 468 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5838 [2021-06-05 21:54:49,016 INFO L430 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:49,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1969430400, now seen corresponding path program 322 times [2021-06-05 21:54:49,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:49,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623415882] [2021-06-05 21:54:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:49,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:49,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623415882] [2021-06-05 21:54:49,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623415882] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:49,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854161403] [2021-06-05 21:54:49,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:49,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:54:49,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:49,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:49,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:49,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:49,256 INFO L388 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 11 [2021-06-05 21:54:49,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:49,258 INFO L388 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 12 [2021-06-05 21:54:49,259 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:49,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:49,276 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:49,276 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:49,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:49,316 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:49,317 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:49,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:49,320 INFO L388 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 12 [2021-06-05 21:54:49,320 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:49,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:49,323 INFO L388 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 12 [2021-06-05 21:54:49,323 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:49,325 INFO L388 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 11 [2021-06-05 21:54:49,326 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:49,359 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:49,359 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:49,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:49,360 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:49,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854161403] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:49,424 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:49,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:49,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588488166] [2021-06-05 21:54:49,424 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:49,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:49,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:49,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:49,424 INFO L87 Difference]: Start difference. First operand 1007 states and 3964 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:49,901 INFO L93 Difference]: Finished difference Result 1122 states and 4320 transitions. [2021-06-05 21:54:49,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:49,901 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:49,903 INFO L225 Difference]: With dead ends: 1122 [2021-06-05 21:54:49,903 INFO L226 Difference]: Without dead ends: 1119 [2021-06-05 21:54:49,903 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 468.3ms TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:54:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2021-06-05 21:54:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1007. [2021-06-05 21:54:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9373757455268388) internal successors, (3961), 1006 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3961 transitions. [2021-06-05 21:54:49,914 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3961 transitions. Word has length 19 [2021-06-05 21:54:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:49,914 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3961 transitions. [2021-06-05 21:54:49,914 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3961 transitions. [2021-06-05 21:54:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:49,916 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:49,916 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:50,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5845,469 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:50,116 INFO L430 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1043406956, now seen corresponding path program 323 times [2021-06-05 21:54:50,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:50,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927262901] [2021-06-05 21:54:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:50,196 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:50,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927262901] [2021-06-05 21:54:50,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927262901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:50,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319783518] [2021-06-05 21:54:50,196 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:50,225 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:54:50,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:50,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:50,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:50,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:50,290 INFO L388 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 18 treesize of output 14 [2021-06-05 21:54:50,290 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:50,292 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:50,293 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:50,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:50,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:50,311 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 21:54:50,347 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 21:54:50,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:50,350 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:50,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:50,353 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:50,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:54:50,356 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:50,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:50,359 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:50,394 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:54:50,394 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:50,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:50,395 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:54:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:50,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319783518] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:50,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:50,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:50,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072072922] [2021-06-05 21:54:50,442 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:50,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:50,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:50,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:50,442 INFO L87 Difference]: Start difference. First operand 1007 states and 3961 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:50,783 INFO L93 Difference]: Finished difference Result 1094 states and 4249 transitions. [2021-06-05 21:54:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:50,785 INFO L225 Difference]: With dead ends: 1094 [2021-06-05 21:54:50,785 INFO L226 Difference]: Without dead ends: 1094 [2021-06-05 21:54:50,786 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 281.7ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:54:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-06-05 21:54:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1000. [2021-06-05 21:54:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.937937937937938) internal successors, (3934), 999 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3934 transitions. [2021-06-05 21:54:50,797 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3934 transitions. Word has length 19 [2021-06-05 21:54:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:50,797 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3934 transitions. [2021-06-05 21:54:50,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3934 transitions. [2021-06-05 21:54:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:50,798 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:50,798 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:50,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5852,470 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:50,998 INFO L430 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:50,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 596489562, now seen corresponding path program 324 times [2021-06-05 21:54:50,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:50,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663454320] [2021-06-05 21:54:50,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:51,103 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:51,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663454320] [2021-06-05 21:54:51,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663454320] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:51,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309444043] [2021-06-05 21:54:51,103 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:51,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:54:51,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:51,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:51,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:51,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:51,222 INFO L388 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 11 [2021-06-05 21:54:51,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:51,225 INFO L388 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 12 [2021-06-05 21:54:51,225 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:51,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:51,242 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:51,242 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:51,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:51,311 INFO L388 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 12 [2021-06-05 21:54:51,312 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:51,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:54:51,315 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:51,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:54:51,318 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:51,319 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:51,320 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:51,337 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 21:54:51,337 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:51,338 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:51,338 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:54:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:51,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309444043] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:51,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:51,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:51,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535200496] [2021-06-05 21:54:51,362 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:51,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:51,362 INFO L87 Difference]: Start difference. First operand 1000 states and 3934 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:51,833 INFO L93 Difference]: Finished difference Result 1088 states and 4228 transitions. [2021-06-05 21:54:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:51,833 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:51,835 INFO L225 Difference]: With dead ends: 1088 [2021-06-05 21:54:51,835 INFO L226 Difference]: Without dead ends: 1082 [2021-06-05 21:54:51,835 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 412.8ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:54:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2021-06-05 21:54:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1000. [2021-06-05 21:54:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.934934934934935) internal successors, (3931), 999 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3931 transitions. [2021-06-05 21:54:51,846 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3931 transitions. Word has length 19 [2021-06-05 21:54:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:51,846 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3931 transitions. [2021-06-05 21:54:51,846 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3931 transitions. [2021-06-05 21:54:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:51,847 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:51,847 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:52,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 471 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5857 [2021-06-05 21:54:52,048 INFO L430 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:52,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1917147636, now seen corresponding path program 325 times [2021-06-05 21:54:52,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:52,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839447936] [2021-06-05 21:54:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:52,125 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:52,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839447936] [2021-06-05 21:54:52,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839447936] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:52,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567325318] [2021-06-05 21:54:52,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:52,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:52,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:52,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:52,218 INFO L388 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 18 treesize of output 14 [2021-06-05 21:54:52,218 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:52,220 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:52,221 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:52,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:52,238 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:52,238 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 21:54:52,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:52,289 INFO L388 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 11 [2021-06-05 21:54:52,290 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:52,292 INFO L388 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 12 [2021-06-05 21:54:52,292 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:52,307 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:54:52,307 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:52,308 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:54:52,308 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:54:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:52,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567325318] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:52,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:52,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:52,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594808155] [2021-06-05 21:54:52,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:52,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:52,328 INFO L87 Difference]: Start difference. First operand 1000 states and 3931 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:52,594 INFO L93 Difference]: Finished difference Result 1091 states and 4243 transitions. [2021-06-05 21:54:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:52,594 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:52,596 INFO L225 Difference]: With dead ends: 1091 [2021-06-05 21:54:52,596 INFO L226 Difference]: Without dead ends: 1091 [2021-06-05 21:54:52,596 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 223.2ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:54:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-06-05 21:54:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1003. [2021-06-05 21:54:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.935129740518962) internal successors, (3943), 1002 states have internal predecessors, (3943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3943 transitions. [2021-06-05 21:54:52,606 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3943 transitions. Word has length 19 [2021-06-05 21:54:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:52,607 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3943 transitions. [2021-06-05 21:54:52,607 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3943 transitions. [2021-06-05 21:54:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:52,608 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:52,608 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:52,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5864,472 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:52,808 INFO L430 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash -969881216, now seen corresponding path program 326 times [2021-06-05 21:54:52,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:52,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979734012] [2021-06-05 21:54:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:52,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:52,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979734012] [2021-06-05 21:54:52,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979734012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:52,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326429393] [2021-06-05 21:54:52,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:52,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:52,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:52,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:52,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:53,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:53,044 INFO L388 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 11 [2021-06-05 21:54:53,045 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,047 INFO L388 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 12 [2021-06-05 21:54:53,047 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,063 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:53,064 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:53,064 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:53,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:53,129 INFO L388 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 11 [2021-06-05 21:54:53,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,132 INFO L388 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 12 [2021-06-05 21:54:53,132 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,147 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:54:53,147 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:53,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,147 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:54:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:53,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326429393] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:53,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:53,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:53,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751153092] [2021-06-05 21:54:53,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:53,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:53,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:53,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:53,169 INFO L87 Difference]: Start difference. First operand 1003 states and 3943 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:53,512 INFO L93 Difference]: Finished difference Result 1106 states and 4284 transitions. [2021-06-05 21:54:53,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:53,513 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:53,514 INFO L225 Difference]: With dead ends: 1106 [2021-06-05 21:54:53,514 INFO L226 Difference]: Without dead ends: 1106 [2021-06-05 21:54:53,514 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 333.5ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:54:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-06-05 21:54:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1012. [2021-06-05 21:54:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 21:54:53,525 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 21:54:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:53,525 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 21:54:53,525 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 21:54:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:53,526 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:53,526 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:53,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5867,473 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:53,727 INFO L430 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1716501810, now seen corresponding path program 327 times [2021-06-05 21:54:53,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:53,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140561101] [2021-06-05 21:54:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:53,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:53,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140561101] [2021-06-05 21:54:53,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140561101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:53,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034474655] [2021-06-05 21:54:53,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:53,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:54:53,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:53,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:53,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:53,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:53,888 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:53,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,891 INFO L388 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 18 treesize of output 14 [2021-06-05 21:54:53,891 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,908 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:53,908 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:53,908 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 21:54:53,971 INFO L446 ElimStorePlain]: Different costs {0=[array_2], 1=[array_4]} [2021-06-05 21:54:53,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:54:53,974 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,976 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:54:53,976 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:53,979 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:54:53,981 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:53,996 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 21:54:53,996 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:53,997 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:53,997 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:54:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:54,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034474655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:54,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:54,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:54,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026751937] [2021-06-05 21:54:54,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:54,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:54,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:54,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:54,017 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:54,402 INFO L93 Difference]: Finished difference Result 1102 states and 4266 transitions. [2021-06-05 21:54:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:54,402 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:54,404 INFO L225 Difference]: With dead ends: 1102 [2021-06-05 21:54:54,404 INFO L226 Difference]: Without dead ends: 1094 [2021-06-05 21:54:54,404 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 311.3ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:54:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-06-05 21:54:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1012. [2021-06-05 21:54:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9268051434223543) internal successors, (3970), 1011 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3970 transitions. [2021-06-05 21:54:54,415 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3970 transitions. Word has length 19 [2021-06-05 21:54:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:54,415 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3970 transitions. [2021-06-05 21:54:54,415 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3970 transitions. [2021-06-05 21:54:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:54,416 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:54,416 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:54,616 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 474 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5870 [2021-06-05 21:54:54,617 INFO L430 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash 511356654, now seen corresponding path program 328 times [2021-06-05 21:54:54,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:54,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119627760] [2021-06-05 21:54:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:54,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:54,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119627760] [2021-06-05 21:54:54,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119627760] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:54,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697717810] [2021-06-05 21:54:54,736 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:54,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:54:54,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:54,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:54,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:54,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:54,856 INFO L388 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 11 [2021-06-05 21:54:54,857 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:54,858 INFO L388 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 12 [2021-06-05 21:54:54,859 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:54,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:54,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:54,875 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:54,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:54,915 INFO L388 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 11 [2021-06-05 21:54:54,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:54,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:54,918 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:54,919 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:54,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:54,922 INFO L388 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 12 [2021-06-05 21:54:54,922 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:54,924 INFO L388 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 12 [2021-06-05 21:54:54,925 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:54,958 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:54,959 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:54,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:54,959 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:55,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697717810] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:55,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:55,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:55,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069788659] [2021-06-05 21:54:55,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:55,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:55,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:55,014 INFO L87 Difference]: Start difference. First operand 1012 states and 3970 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:55,450 INFO L93 Difference]: Finished difference Result 1098 states and 4262 transitions. [2021-06-05 21:54:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:55,450 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:55,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:55,452 INFO L225 Difference]: With dead ends: 1098 [2021-06-05 21:54:55,452 INFO L226 Difference]: Without dead ends: 1098 [2021-06-05 21:54:55,452 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 389.1ms TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:54:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-06-05 21:54:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1015. [2021-06-05 21:54:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.924063116370809) internal successors, (3979), 1014 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3979 transitions. [2021-06-05 21:54:55,463 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3979 transitions. Word has length 19 [2021-06-05 21:54:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:55,463 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3979 transitions. [2021-06-05 21:54:55,463 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3979 transitions. [2021-06-05 21:54:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:55,464 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:55,464 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:55,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5876,475 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:55,664 INFO L430 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:55,665 INFO L82 PathProgramCache]: Analyzing trace with hash -233595918, now seen corresponding path program 329 times [2021-06-05 21:54:55,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:55,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376111308] [2021-06-05 21:54:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:55,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:55,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376111308] [2021-06-05 21:54:55,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376111308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:55,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872458467] [2021-06-05 21:54:55,745 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:55,773 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:54:55,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:55,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:55,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:55,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:55,837 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:55,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:55,839 INFO L388 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 18 treesize of output 14 [2021-06-05 21:54:55,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:55,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:55,857 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:55,857 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 21:54:55,892 INFO L446 ElimStorePlain]: Different costs {0=[array_2], 1=[array_4]} [2021-06-05 21:54:55,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:54:55,896 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:55,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:55,898 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:55,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:55,901 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:55,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:55,904 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:55,937 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:55,938 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:55,938 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:55,938 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:55,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872458467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:55,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:55,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:55,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476794029] [2021-06-05 21:54:55,985 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:55,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:55,985 INFO L87 Difference]: Start difference. First operand 1015 states and 3979 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:56,377 INFO L93 Difference]: Finished difference Result 1109 states and 4296 transitions. [2021-06-05 21:54:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:56,377 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:56,379 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 21:54:56,379 INFO L226 Difference]: Without dead ends: 1109 [2021-06-05 21:54:56,379 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 339.5ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:54:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-06-05 21:54:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1009. [2021-06-05 21:54:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.929563492063492) internal successors, (3961), 1008 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3961 transitions. [2021-06-05 21:54:56,390 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3961 transitions. Word has length 19 [2021-06-05 21:54:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:56,390 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3961 transitions. [2021-06-05 21:54:56,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3961 transitions. [2021-06-05 21:54:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:56,391 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:56,391 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:56,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 476 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5881 [2021-06-05 21:54:56,591 INFO L430 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash -804800650, now seen corresponding path program 330 times [2021-06-05 21:54:56,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:56,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733518850] [2021-06-05 21:54:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:56,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:56,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733518850] [2021-06-05 21:54:56,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733518850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:56,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960322231] [2021-06-05 21:54:56,718 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:56,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:54:56,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:56,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:56,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:56,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:56,836 INFO L388 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 11 [2021-06-05 21:54:56,837 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:56,839 INFO L388 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 12 [2021-06-05 21:54:56,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:56,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:56,856 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:56,856 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:56,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:56,896 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:56,897 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:56,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:56,899 INFO L388 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 12 [2021-06-05 21:54:56,900 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:56,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:56,902 INFO L388 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 12 [2021-06-05 21:54:56,903 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:56,905 INFO L388 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 11 [2021-06-05 21:54:56,905 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:56,938 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:56,939 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:56,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:56,939 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:56,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960322231] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:56,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:56,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:56,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950903472] [2021-06-05 21:54:56,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:56,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:56,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:56,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:56,992 INFO L87 Difference]: Start difference. First operand 1009 states and 3961 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:57,389 INFO L93 Difference]: Finished difference Result 1118 states and 4307 transitions. [2021-06-05 21:54:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:54:57,389 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:57,391 INFO L225 Difference]: With dead ends: 1118 [2021-06-05 21:54:57,391 INFO L226 Difference]: Without dead ends: 1118 [2021-06-05 21:54:57,391 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 395.2ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:54:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2021-06-05 21:54:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1015. [2021-06-05 21:54:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.932938856015779) internal successors, (3988), 1014 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3988 transitions. [2021-06-05 21:54:57,402 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3988 transitions. Word has length 19 [2021-06-05 21:54:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:57,402 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3988 transitions. [2021-06-05 21:54:57,402 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3988 transitions. [2021-06-05 21:54:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:57,404 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:57,404 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:57,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5886,477 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:57,604 INFO L430 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash 390235524, now seen corresponding path program 331 times [2021-06-05 21:54:57,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:57,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865619952] [2021-06-05 21:54:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:57,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:57,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865619952] [2021-06-05 21:54:57,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865619952] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:57,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754802580] [2021-06-05 21:54:57,681 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:57,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:57,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:57,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:57,780 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:57,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:57,782 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:57,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:57,799 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:57,799 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:57,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:57,836 INFO L388 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 12 [2021-06-05 21:54:57,837 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:57,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:57,839 INFO L388 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 11 [2021-06-05 21:54:57,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:57,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:57,842 INFO L388 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 12 [2021-06-05 21:54:57,843 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:57,845 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:57,846 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:57,879 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:57,880 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:57,880 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:57,880 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:57,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754802580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:57,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:57,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:54:57,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075645480] [2021-06-05 21:54:57,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:54:57,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:57,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:54:57,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:54:57,939 INFO L87 Difference]: Start difference. First operand 1015 states and 3988 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:58,315 INFO L93 Difference]: Finished difference Result 1124 states and 4324 transitions. [2021-06-05 21:54:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:54:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:58,317 INFO L225 Difference]: With dead ends: 1124 [2021-06-05 21:54:58,317 INFO L226 Difference]: Without dead ends: 1120 [2021-06-05 21:54:58,317 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 369.9ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:54:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2021-06-05 21:54:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1019. [2021-06-05 21:54:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.932220039292731) internal successors, (4003), 1018 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4003 transitions. [2021-06-05 21:54:58,328 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4003 transitions. Word has length 19 [2021-06-05 21:54:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:58,328 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4003 transitions. [2021-06-05 21:54:58,328 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4003 transitions. [2021-06-05 21:54:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:58,329 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:58,329 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:58,529 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 478 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5891 [2021-06-05 21:54:58,530 INFO L430 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1819190630, now seen corresponding path program 332 times [2021-06-05 21:54:58,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:58,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827810843] [2021-06-05 21:54:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:58,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:58,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827810843] [2021-06-05 21:54:58,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827810843] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:58,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897399933] [2021-06-05 21:54:58,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:58,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:54:58,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:58,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:58,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:58,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:58,793 INFO L388 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 11 [2021-06-05 21:54:58,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:58,796 INFO L388 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 12 [2021-06-05 21:54:58,797 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:58,816 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:58,817 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:58,817 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:58,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:58,866 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:58,867 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:58,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:58,870 INFO L388 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 12 [2021-06-05 21:54:58,871 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:58,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:58,874 INFO L388 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 12 [2021-06-05 21:54:58,875 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:58,878 INFO L388 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 11 [2021-06-05 21:54:58,878 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:58,923 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:58,924 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:58,924 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:58,924 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:54:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:58,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897399933] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:58,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:54:58,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:54:58,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542991872] [2021-06-05 21:54:58,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:54:58,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:54:58,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:54:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:54:58,987 INFO L87 Difference]: Start difference. First operand 1019 states and 4003 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:54:59,492 INFO L93 Difference]: Finished difference Result 1121 states and 4317 transitions. [2021-06-05 21:54:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:54:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:54:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:54:59,494 INFO L225 Difference]: With dead ends: 1121 [2021-06-05 21:54:59,494 INFO L226 Difference]: Without dead ends: 1118 [2021-06-05 21:54:59,495 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 457.5ms TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:54:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2021-06-05 21:54:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1019. [2021-06-05 21:54:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.9292730844793713) internal successors, (4000), 1018 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4000 transitions. [2021-06-05 21:54:59,506 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4000 transitions. Word has length 19 [2021-06-05 21:54:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:54:59,506 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4000 transitions. [2021-06-05 21:54:59,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:54:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4000 transitions. [2021-06-05 21:54:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:54:59,507 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:54:59,507 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:54:59,707 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5898,479 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:59,708 INFO L430 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:54:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:54:59,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1549753222, now seen corresponding path program 333 times [2021-06-05 21:54:59,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:54:59,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092705340] [2021-06-05 21:54:59,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:54:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:54:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:54:59,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:54:59,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092705340] [2021-06-05 21:54:59,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092705340] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:54:59,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13408568] [2021-06-05 21:54:59,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:54:59,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:54:59,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:54:59,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:54:59,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:54:59,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:54:59,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:59,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:54:59,881 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:59,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:54:59,897 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:59,897 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:54:59,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:59,935 INFO L388 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 12 [2021-06-05 21:54:59,935 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:59,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:59,938 INFO L388 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 11 [2021-06-05 21:54:59,938 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:59,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:54:59,941 INFO L388 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 12 [2021-06-05 21:54:59,941 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:59,943 INFO L388 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 17 treesize of output 13 [2021-06-05 21:54:59,944 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:54:59,978 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:54:59,978 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:54:59,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:54:59,978 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:00,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13408568] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:00,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:00,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:55:00,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816893208] [2021-06-05 21:55:00,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:55:00,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:00,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:55:00,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:55:00,036 INFO L87 Difference]: Start difference. First operand 1019 states and 4000 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:00,437 INFO L93 Difference]: Finished difference Result 1109 states and 4293 transitions. [2021-06-05 21:55:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:55:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:00,439 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 21:55:00,439 INFO L226 Difference]: Without dead ends: 1109 [2021-06-05 21:55:00,439 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 344.0ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:55:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-06-05 21:55:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1012. [2021-06-05 21:55:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 21:55:00,451 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 21:55:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:00,451 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 21:55:00,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 21:55:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:00,453 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:00,453 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:00,653 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 480 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5905 [2021-06-05 21:55:00,653 INFO L430 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:00,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash 90143296, now seen corresponding path program 334 times [2021-06-05 21:55:00,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:00,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46381098] [2021-06-05 21:55:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:00,757 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:00,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46381098] [2021-06-05 21:55:00,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46381098] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:00,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020631852] [2021-06-05 21:55:00,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:00,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:55:00,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:00,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:00,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:00,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:00,873 INFO L388 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 11 [2021-06-05 21:55:00,873 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:00,875 INFO L388 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 12 [2021-06-05 21:55:00,876 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:00,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:00,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:00,892 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:00,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:00,960 INFO L388 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 12 [2021-06-05 21:55:00,961 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:00,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:55:00,964 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:00,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:55:00,966 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:00,968 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:00,969 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:00,985 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 21:55:00,986 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:00,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:00,986 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:55:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:01,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020631852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:01,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:01,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:01,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090587401] [2021-06-05 21:55:01,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:01,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:01,010 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:01,367 INFO L93 Difference]: Finished difference Result 1094 states and 4245 transitions. [2021-06-05 21:55:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:01,367 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:01,369 INFO L225 Difference]: With dead ends: 1094 [2021-06-05 21:55:01,369 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 21:55:01,369 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 369.7ms TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:55:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 21:55:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1012. [2021-06-05 21:55:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9268051434223543) internal successors, (3970), 1011 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3970 transitions. [2021-06-05 21:55:01,380 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3970 transitions. Word has length 19 [2021-06-05 21:55:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:01,380 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3970 transitions. [2021-06-05 21:55:01,380 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3970 transitions. [2021-06-05 21:55:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:01,381 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:01,381 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:01,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5910,481 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:01,582 INFO L430 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1871473394, now seen corresponding path program 335 times [2021-06-05 21:55:01,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:01,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873634456] [2021-06-05 21:55:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:01,657 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:01,657 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873634456] [2021-06-05 21:55:01,657 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873634456] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:01,657 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561180813] [2021-06-05 21:55:01,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:01,687 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:55:01,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:01,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:01,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:01,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:55:01,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:01,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:01,754 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:01,770 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:01,771 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:01,771 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:01,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:01,820 INFO L388 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 11 [2021-06-05 21:55:01,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:01,823 INFO L388 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 12 [2021-06-05 21:55:01,823 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:01,838 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:01,839 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:01,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:01,839 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:01,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561180813] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:01,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:01,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:55:01,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625669308] [2021-06-05 21:55:01,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:55:01,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:01,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:55:01,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:55:01,860 INFO L87 Difference]: Start difference. First operand 1012 states and 3970 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:02,104 INFO L93 Difference]: Finished difference Result 1100 states and 4269 transitions. [2021-06-05 21:55:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:02,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:02,107 INFO L225 Difference]: With dead ends: 1100 [2021-06-05 21:55:02,107 INFO L226 Difference]: Without dead ends: 1100 [2021-06-05 21:55:02,107 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 217.4ms TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:55:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2021-06-05 21:55:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1006. [2021-06-05 21:55:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 3.9323383084577115) internal successors, (3952), 1005 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3952 transitions. [2021-06-05 21:55:02,118 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3952 transitions. Word has length 19 [2021-06-05 21:55:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:02,118 INFO L482 AbstractCegarLoop]: Abstraction has 1006 states and 3952 transitions. [2021-06-05 21:55:02,118 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3952 transitions. [2021-06-05 21:55:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:02,119 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:02,119 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:02,319 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 482 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5917 [2021-06-05 21:55:02,320 INFO L430 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1340030452, now seen corresponding path program 336 times [2021-06-05 21:55:02,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:02,320 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501262538] [2021-06-05 21:55:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:02,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:02,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501262538] [2021-06-05 21:55:02,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501262538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:02,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082655412] [2021-06-05 21:55:02,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:02,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:55:02,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:02,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:02,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:02,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:02,554 INFO L388 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 11 [2021-06-05 21:55:02,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:02,557 INFO L388 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 12 [2021-06-05 21:55:02,558 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:02,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:02,571 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:02,571 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:02,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:02,637 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:02,638 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:02,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:02,640 INFO L388 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 12 [2021-06-05 21:55:02,641 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:02,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:02,643 INFO L388 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 12 [2021-06-05 21:55:02,644 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:02,646 INFO L388 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 11 [2021-06-05 21:55:02,647 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:02,680 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:02,681 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:02,681 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:02,681 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:02,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082655412] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:02,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:02,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:02,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153423993] [2021-06-05 21:55:02,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:02,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:02,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:02,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:02,736 INFO L87 Difference]: Start difference. First operand 1006 states and 3952 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:03,381 INFO L93 Difference]: Finished difference Result 1214 states and 4633 transitions. [2021-06-05 21:55:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:55:03,381 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:03,383 INFO L225 Difference]: With dead ends: 1214 [2021-06-05 21:55:03,383 INFO L226 Difference]: Without dead ends: 1214 [2021-06-05 21:55:03,383 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 571.7ms TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:55:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-06-05 21:55:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1015. [2021-06-05 21:55:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.9358974358974357) internal successors, (3991), 1014 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3991 transitions. [2021-06-05 21:55:03,395 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3991 transitions. Word has length 19 [2021-06-05 21:55:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:03,395 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3991 transitions. [2021-06-05 21:55:03,395 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3991 transitions. [2021-06-05 21:55:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:03,396 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:03,396 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:03,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5920,483 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:03,596 INFO L430 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:03,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash -144994278, now seen corresponding path program 337 times [2021-06-05 21:55:03,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:03,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814904626] [2021-06-05 21:55:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:03,683 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:03,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814904626] [2021-06-05 21:55:03,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814904626] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:03,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531281605] [2021-06-05 21:55:03,683 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:03,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:03,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:03,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:03,761 INFO L388 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 12 [2021-06-05 21:55:03,761 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:03,763 INFO L388 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 11 [2021-06-05 21:55:03,764 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:03,777 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:03,777 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:03,777 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:03,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:03,836 INFO L388 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 12 [2021-06-05 21:55:03,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:03,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:03,839 INFO L388 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 11 [2021-06-05 21:55:03,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:03,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:03,842 INFO L388 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 12 [2021-06-05 21:55:03,843 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:03,845 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:03,846 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:03,879 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:03,879 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:03,880 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:03,880 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:03,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531281605] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:03,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:03,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:55:03,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867868768] [2021-06-05 21:55:03,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:55:03,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:55:03,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:55:03,939 INFO L87 Difference]: Start difference. First operand 1015 states and 3991 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:04,489 INFO L93 Difference]: Finished difference Result 1219 states and 4648 transitions. [2021-06-05 21:55:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 21:55:04,489 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:04,491 INFO L225 Difference]: With dead ends: 1219 [2021-06-05 21:55:04,491 INFO L226 Difference]: Without dead ends: 1215 [2021-06-05 21:55:04,491 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 493.8ms TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:55:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2021-06-05 21:55:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1019. [2021-06-05 21:55:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.9351669941060905) internal successors, (4006), 1018 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4006 transitions. [2021-06-05 21:55:04,503 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4006 transitions. Word has length 19 [2021-06-05 21:55:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:04,503 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4006 transitions. [2021-06-05 21:55:04,503 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4006 transitions. [2021-06-05 21:55:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:04,504 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:04,504 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:04,704 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 484 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5925 [2021-06-05 21:55:04,705 INFO L430 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1283960828, now seen corresponding path program 338 times [2021-06-05 21:55:04,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:04,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758322583] [2021-06-05 21:55:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:04,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:04,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758322583] [2021-06-05 21:55:04,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758322583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:04,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266042034] [2021-06-05 21:55:04,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:04,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:04,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:04,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:04,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:04,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:04,933 INFO L388 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 11 [2021-06-05 21:55:04,934 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:04,936 INFO L388 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 12 [2021-06-05 21:55:04,937 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:04,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:04,950 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:04,950 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:05,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:05,014 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:05,015 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:05,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:05,017 INFO L388 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 12 [2021-06-05 21:55:05,018 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:05,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:05,021 INFO L388 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 12 [2021-06-05 21:55:05,021 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:05,023 INFO L388 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 11 [2021-06-05 21:55:05,024 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:05,057 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:05,057 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:05,058 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:05,058 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:05,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266042034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:05,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:05,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:05,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927073145] [2021-06-05 21:55:05,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:05,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:05,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:05,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:05,122 INFO L87 Difference]: Start difference. First operand 1019 states and 4006 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:05,834 INFO L93 Difference]: Finished difference Result 1217 states and 4643 transitions. [2021-06-05 21:55:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:55:05,834 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:05,836 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 21:55:05,836 INFO L226 Difference]: Without dead ends: 1214 [2021-06-05 21:55:05,836 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 622.1ms TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:55:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-06-05 21:55:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1019. [2021-06-05 21:55:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.932220039292731) internal successors, (4003), 1018 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4003 transitions. [2021-06-05 21:55:05,848 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4003 transitions. Word has length 19 [2021-06-05 21:55:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:05,848 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4003 transitions. [2021-06-05 21:55:05,848 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4003 transitions. [2021-06-05 21:55:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:05,850 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:05,850 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:06,050 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5932,485 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:06,050 INFO L430 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2084983024, now seen corresponding path program 339 times [2021-06-05 21:55:06,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:06,051 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217007199] [2021-06-05 21:55:06,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:06,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:06,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217007199] [2021-06-05 21:55:06,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217007199] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:06,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404260693] [2021-06-05 21:55:06,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:06,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:55:06,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:06,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:06,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:06,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:06,208 INFO L388 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 12 [2021-06-05 21:55:06,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:06,210 INFO L388 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 11 [2021-06-05 21:55:06,211 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:06,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:06,225 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:06,225 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:06,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:06,284 INFO L388 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 12 [2021-06-05 21:55:06,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:06,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:06,287 INFO L388 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 11 [2021-06-05 21:55:06,288 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:06,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:06,291 INFO L388 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 12 [2021-06-05 21:55:06,291 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:06,293 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:06,294 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:06,328 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:06,328 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:06,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:06,329 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:06,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404260693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:06,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:06,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:55:06,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709920808] [2021-06-05 21:55:06,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:55:06,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:06,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:55:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:55:06,376 INFO L87 Difference]: Start difference. First operand 1019 states and 4003 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:06,905 INFO L93 Difference]: Finished difference Result 1204 states and 4617 transitions. [2021-06-05 21:55:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:55:06,906 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:06,908 INFO L225 Difference]: With dead ends: 1204 [2021-06-05 21:55:06,908 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 21:55:06,908 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 433.0ms TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:55:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 21:55:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1012. [2021-06-05 21:55:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9327398615232445) internal successors, (3976), 1011 states have internal predecessors, (3976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3976 transitions. [2021-06-05 21:55:06,927 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3976 transitions. Word has length 19 [2021-06-05 21:55:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:06,927 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3976 transitions. [2021-06-05 21:55:06,927 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3976 transitions. [2021-06-05 21:55:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:06,928 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:06,928 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:07,128 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 486 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5939 [2021-06-05 21:55:07,128 INFO L430 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash -445086506, now seen corresponding path program 340 times [2021-06-05 21:55:07,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:07,129 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142350198] [2021-06-05 21:55:07,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:07,236 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:07,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142350198] [2021-06-05 21:55:07,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142350198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:07,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675812252] [2021-06-05 21:55:07,236 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:07,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:55:07,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:07,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:07,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:07,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:07,335 INFO L388 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 11 [2021-06-05 21:55:07,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:07,338 INFO L388 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 12 [2021-06-05 21:55:07,338 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:07,351 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:07,351 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:07,351 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:07,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:07,432 INFO L388 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 12 [2021-06-05 21:55:07,433 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:07,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:55:07,435 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:07,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:55:07,438 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:07,440 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:07,441 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:07,457 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 21:55:07,458 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:07,458 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:07,458 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:55:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:07,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675812252] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:07,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:07,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:07,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633548023] [2021-06-05 21:55:07,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:07,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:07,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:07,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:07,482 INFO L87 Difference]: Start difference. First operand 1012 states and 3976 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:08,051 INFO L93 Difference]: Finished difference Result 1193 states and 4577 transitions. [2021-06-05 21:55:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:55:08,051 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:08,053 INFO L225 Difference]: With dead ends: 1193 [2021-06-05 21:55:08,053 INFO L226 Difference]: Without dead ends: 1187 [2021-06-05 21:55:08,053 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 477.3ms TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:55:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2021-06-05 21:55:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1012. [2021-06-05 21:55:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 21:55:08,072 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 21:55:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:08,072 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 21:55:08,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 21:55:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:08,074 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:08,074 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:08,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5944,487 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:08,274 INFO L430 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:08,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1336243592, now seen corresponding path program 341 times [2021-06-05 21:55:08,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:08,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298205684] [2021-06-05 21:55:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:08,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:08,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298205684] [2021-06-05 21:55:08,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298205684] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:08,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431342144] [2021-06-05 21:55:08,353 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:08,382 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 21:55:08,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:08,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 21:55:08,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:08,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:08,432 INFO L388 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 12 [2021-06-05 21:55:08,433 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:08,435 INFO L388 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 11 [2021-06-05 21:55:08,436 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:08,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:08,450 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:08,450 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:08,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:08,521 INFO L388 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 11 [2021-06-05 21:55:08,522 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:08,524 INFO L388 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 12 [2021-06-05 21:55:08,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:08,540 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:08,540 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:08,540 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:08,540 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:08,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431342144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:08,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:08,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 21:55:08,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053353545] [2021-06-05 21:55:08,560 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 21:55:08,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 21:55:08,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 21:55:08,561 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:08,921 INFO L93 Difference]: Finished difference Result 1186 states and 4563 transitions. [2021-06-05 21:55:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:08,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:08,923 INFO L225 Difference]: With dead ends: 1186 [2021-06-05 21:55:08,923 INFO L226 Difference]: Without dead ends: 1186 [2021-06-05 21:55:08,923 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 255.6ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-06-05 21:55:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1009. [2021-06-05 21:55:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.9325396825396823) internal successors, (3964), 1008 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3964 transitions. [2021-06-05 21:55:08,934 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3964 transitions. Word has length 19 [2021-06-05 21:55:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:08,934 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3964 transitions. [2021-06-05 21:55:08,934 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3964 transitions. [2021-06-05 21:55:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:08,936 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:08,936 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:09,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5950,488 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:09,136 INFO L430 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1761243810, now seen corresponding path program 342 times [2021-06-05 21:55:09,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:09,136 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714167581] [2021-06-05 21:55:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:09,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:09,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714167581] [2021-06-05 21:55:09,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714167581] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:09,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191211710] [2021-06-05 21:55:09,237 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:09,265 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:55:09,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:09,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:09,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:09,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:09,345 INFO L388 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 11 [2021-06-05 21:55:09,345 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:09,347 INFO L388 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 12 [2021-06-05 21:55:09,348 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:09,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:09,361 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:09,361 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:09,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:09,430 INFO L388 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 12 [2021-06-05 21:55:09,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:09,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:55:09,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:09,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:55:09,436 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:09,437 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:09,438 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:09,456 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 21:55:09,456 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:09,456 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:09,456 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:55:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:09,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191211710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:09,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:09,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:09,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984284243] [2021-06-05 21:55:09,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:09,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:09,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:09,480 INFO L87 Difference]: Start difference. First operand 1009 states and 3964 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:09,917 INFO L93 Difference]: Finished difference Result 1174 states and 4521 transitions. [2021-06-05 21:55:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:09,917 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:09,919 INFO L225 Difference]: With dead ends: 1174 [2021-06-05 21:55:09,919 INFO L226 Difference]: Without dead ends: 1165 [2021-06-05 21:55:09,919 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 437.6ms TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:55:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-06-05 21:55:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1009. [2021-06-05 21:55:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.929563492063492) internal successors, (3961), 1008 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3961 transitions. [2021-06-05 21:55:09,931 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3961 transitions. Word has length 19 [2021-06-05 21:55:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:09,931 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3961 transitions. [2021-06-05 21:55:09,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3961 transitions. [2021-06-05 21:55:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:09,932 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:09,932 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:10,132 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5953,489 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:10,132 INFO L430 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash 764788786, now seen corresponding path program 343 times [2021-06-05 21:55:10,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:10,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079118895] [2021-06-05 21:55:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:10,204 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:10,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079118895] [2021-06-05 21:55:10,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079118895] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:10,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283403697] [2021-06-05 21:55:10,204 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:10,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:10,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:10,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:10,282 INFO L388 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 12 [2021-06-05 21:55:10,282 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:10,284 INFO L388 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 11 [2021-06-05 21:55:10,285 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:10,298 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:10,298 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:10,299 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:10,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:10,350 INFO L388 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 11 [2021-06-05 21:55:10,350 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:10,352 INFO L388 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 12 [2021-06-05 21:55:10,353 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:10,368 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:10,368 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:10,369 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:10,369 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:10,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283403697] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:10,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:10,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-06-05 21:55:10,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011392742] [2021-06-05 21:55:10,388 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 21:55:10,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:10,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 21:55:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 21:55:10,388 INFO L87 Difference]: Start difference. First operand 1009 states and 3961 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:10,679 INFO L93 Difference]: Finished difference Result 1241 states and 4758 transitions. [2021-06-05 21:55:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:10,680 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:10,682 INFO L225 Difference]: With dead ends: 1241 [2021-06-05 21:55:10,682 INFO L226 Difference]: Without dead ends: 1241 [2021-06-05 21:55:10,682 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 211.8ms TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:55:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-06-05 21:55:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1012. [2021-06-05 21:55:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 21:55:10,694 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 21:55:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:10,694 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 21:55:10,694 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 21:55:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:10,695 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:10,695 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:10,895 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 490 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5959 [2021-06-05 21:55:10,895 INFO L430 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:10,896 INFO L82 PathProgramCache]: Analyzing trace with hash -136082742, now seen corresponding path program 344 times [2021-06-05 21:55:10,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:10,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154407810] [2021-06-05 21:55:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:11,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:11,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154407810] [2021-06-05 21:55:11,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154407810] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:11,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447866739] [2021-06-05 21:55:11,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:11,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:11,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:11,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:11,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:11,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:11,127 INFO L388 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 12 [2021-06-05 21:55:11,127 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:11,129 INFO L388 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 11 [2021-06-05 21:55:11,130 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:11,143 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:11,143 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:11,143 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:11,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:11,212 INFO L388 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 11 [2021-06-05 21:55:11,213 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:11,215 INFO L388 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 12 [2021-06-05 21:55:11,216 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:11,230 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:11,231 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:11,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:11,231 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:11,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447866739] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:11,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:11,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:11,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438832236] [2021-06-05 21:55:11,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:11,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:11,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:11,253 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:11,646 INFO L93 Difference]: Finished difference Result 1290 states and 4947 transitions. [2021-06-05 21:55:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:11,647 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:11,649 INFO L225 Difference]: With dead ends: 1290 [2021-06-05 21:55:11,649 INFO L226 Difference]: Without dead ends: 1290 [2021-06-05 21:55:11,649 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 345.1ms TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 21:55:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2021-06-05 21:55:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1017. [2021-06-05 21:55:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 3.925196850393701) internal successors, (3988), 1016 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 3988 transitions. [2021-06-05 21:55:11,662 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 3988 transitions. Word has length 19 [2021-06-05 21:55:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:11,662 INFO L482 AbstractCegarLoop]: Abstraction has 1017 states and 3988 transitions. [2021-06-05 21:55:11,662 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 3988 transitions. [2021-06-05 21:55:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:11,663 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:11,663 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:11,863 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5962,491 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:11,863 INFO L430 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:11,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2085149096, now seen corresponding path program 345 times [2021-06-05 21:55:11,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:11,864 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042867553] [2021-06-05 21:55:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:11,987 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:11,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042867553] [2021-06-05 21:55:11,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042867553] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:11,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355283332] [2021-06-05 21:55:11,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:12,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:55:12,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:12,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:12,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:12,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:12,096 INFO L388 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 12 [2021-06-05 21:55:12,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:12,098 INFO L388 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 11 [2021-06-05 21:55:12,099 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:12,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:12,112 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:12,112 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:12,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:12,194 INFO L388 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 11 [2021-06-05 21:55:12,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:12,197 INFO L388 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 12 [2021-06-05 21:55:12,197 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:12,212 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:12,212 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:12,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:12,212 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:12,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355283332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:12,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:12,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:12,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618468804] [2021-06-05 21:55:12,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:12,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:12,234 INFO L87 Difference]: Start difference. First operand 1017 states and 3988 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:12,634 INFO L93 Difference]: Finished difference Result 1213 states and 4672 transitions. [2021-06-05 21:55:12,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:12,635 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:12,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:12,637 INFO L225 Difference]: With dead ends: 1213 [2021-06-05 21:55:12,637 INFO L226 Difference]: Without dead ends: 1213 [2021-06-05 21:55:12,637 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 329.2ms TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:55:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2021-06-05 21:55:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1020. [2021-06-05 21:55:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9254170755642788) internal successors, (4000), 1019 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4000 transitions. [2021-06-05 21:55:12,648 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4000 transitions. Word has length 19 [2021-06-05 21:55:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:12,648 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4000 transitions. [2021-06-05 21:55:12,648 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4000 transitions. [2021-06-05 21:55:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:12,650 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:12,650 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:12,850 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5965,492 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:12,850 INFO L430 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash 601233930, now seen corresponding path program 346 times [2021-06-05 21:55:12,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:12,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420677532] [2021-06-05 21:55:12,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:12,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:12,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420677532] [2021-06-05 21:55:12,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420677532] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:12,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843665344] [2021-06-05 21:55:12,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:12,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:55:12,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:12,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:12,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:13,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:55:13,050 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:13,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:13,052 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:13,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:13,066 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:13,066 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 21:55:13,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:13,147 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:13,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:13,150 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:55:13,150 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:13,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:55:13,153 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:13,155 INFO L388 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 12 [2021-06-05 21:55:13,155 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:13,170 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 21:55:13,171 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:13,171 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:13,171 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:55:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:13,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843665344] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:13,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:13,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:13,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233836743] [2021-06-05 21:55:13,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:13,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:13,193 INFO L87 Difference]: Start difference. First operand 1020 states and 4000 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:13,460 INFO L93 Difference]: Finished difference Result 1203 states and 4636 transitions. [2021-06-05 21:55:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:13,462 INFO L225 Difference]: With dead ends: 1203 [2021-06-05 21:55:13,463 INFO L226 Difference]: Without dead ends: 1195 [2021-06-05 21:55:13,463 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 266.8ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:55:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2021-06-05 21:55:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1020. [2021-06-05 21:55:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9224730127576053) internal successors, (3997), 1019 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 3997 transitions. [2021-06-05 21:55:13,474 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 3997 transitions. Word has length 19 [2021-06-05 21:55:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:13,474 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 3997 transitions. [2021-06-05 21:55:13,474 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 3997 transitions. [2021-06-05 21:55:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:13,476 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:13,476 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:13,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5968,493 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:13,676 INFO L430 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash -603911226, now seen corresponding path program 347 times [2021-06-05 21:55:13,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:13,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669129863] [2021-06-05 21:55:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:13,815 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:13,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669129863] [2021-06-05 21:55:13,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669129863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:13,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636122986] [2021-06-05 21:55:13,815 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:13,844 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:13,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:13,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:13,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:13,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:13,925 INFO L388 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 12 [2021-06-05 21:55:13,926 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:13,928 INFO L388 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 11 [2021-06-05 21:55:13,929 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:13,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:13,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:13,949 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:14,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:14,049 INFO L388 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 11 [2021-06-05 21:55:14,050 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:14,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:14,052 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:14,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:14,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:14,056 INFO L388 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 12 [2021-06-05 21:55:14,057 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:14,059 INFO L388 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 12 [2021-06-05 21:55:14,060 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:14,093 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:14,093 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:14,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:14,094 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:14,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636122986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:14,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:14,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:14,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771157726] [2021-06-05 21:55:14,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:14,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:14,148 INFO L87 Difference]: Start difference. First operand 1020 states and 3997 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:14,799 INFO L93 Difference]: Finished difference Result 1246 states and 4755 transitions. [2021-06-05 21:55:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:55:14,799 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:14,801 INFO L225 Difference]: With dead ends: 1246 [2021-06-05 21:55:14,801 INFO L226 Difference]: Without dead ends: 1246 [2021-06-05 21:55:14,801 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 607.3ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:55:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2021-06-05 21:55:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1023. [2021-06-05 21:55:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.9256360078277885) internal successors, (4012), 1022 states have internal predecessors, (4012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4012 transitions. [2021-06-05 21:55:14,813 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4012 transitions. Word has length 19 [2021-06-05 21:55:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:14,813 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4012 transitions. [2021-06-05 21:55:14,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4012 transitions. [2021-06-05 21:55:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:14,815 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:14,815 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:15,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5974,494 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:15,015 INFO L430 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:15,015 INFO L82 PathProgramCache]: Analyzing trace with hash 591124948, now seen corresponding path program 348 times [2021-06-05 21:55:15,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:15,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554742092] [2021-06-05 21:55:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:15,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:15,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554742092] [2021-06-05 21:55:15,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554742092] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:15,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598967773] [2021-06-05 21:55:15,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:15,147 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:55:15,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:15,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:15,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:15,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:55:15,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:15,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:15,227 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:15,240 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:15,241 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:15,241 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 21:55:15,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:15,305 INFO L388 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 12 [2021-06-05 21:55:15,306 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:15,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:15,309 INFO L388 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 11 [2021-06-05 21:55:15,309 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:15,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:15,312 INFO L388 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 12 [2021-06-05 21:55:15,312 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:15,314 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:15,315 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:15,350 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:55:15,350 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:15,351 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:15,351 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:55:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:15,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598967773] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:15,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:15,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:15,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920400641] [2021-06-05 21:55:15,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:15,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:15,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:15,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:15,414 INFO L87 Difference]: Start difference. First operand 1023 states and 4012 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:15,875 INFO L93 Difference]: Finished difference Result 1222 states and 4685 transitions. [2021-06-05 21:55:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:55:15,876 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:15,877 INFO L225 Difference]: With dead ends: 1222 [2021-06-05 21:55:15,878 INFO L226 Difference]: Without dead ends: 1218 [2021-06-05 21:55:15,878 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 472.5ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 21:55:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2021-06-05 21:55:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1027. [2021-06-05 21:55:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.9249512670565303) internal successors, (4027), 1026 states have internal predecessors, (4027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4027 transitions. [2021-06-05 21:55:15,893 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4027 transitions. Word has length 19 [2021-06-05 21:55:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:15,893 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4027 transitions. [2021-06-05 21:55:15,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4027 transitions. [2021-06-05 21:55:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:15,895 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:15,895 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:16,095 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 495 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5979 [2021-06-05 21:55:16,095 INFO L430 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2020080054, now seen corresponding path program 349 times [2021-06-05 21:55:16,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:16,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761981956] [2021-06-05 21:55:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:16,227 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:16,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761981956] [2021-06-05 21:55:16,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761981956] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:16,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55208692] [2021-06-05 21:55:16,227 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:16,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:16,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:16,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:16,334 INFO L388 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 12 [2021-06-05 21:55:16,335 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:16,337 INFO L388 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 11 [2021-06-05 21:55:16,337 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:16,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:16,359 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:16,359 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:16,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:16,423 INFO L388 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 11 [2021-06-05 21:55:16,424 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:16,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:16,426 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:16,427 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:16,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:16,430 INFO L388 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 12 [2021-06-05 21:55:16,431 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:16,433 INFO L388 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 12 [2021-06-05 21:55:16,433 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:16,467 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:16,467 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:16,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:16,467 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:16,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55208692] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:16,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:16,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:16,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249090680] [2021-06-05 21:55:16,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:16,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:16,531 INFO L87 Difference]: Start difference. First operand 1027 states and 4027 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:17,147 INFO L93 Difference]: Finished difference Result 1229 states and 4723 transitions. [2021-06-05 21:55:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 21:55:17,147 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:17,149 INFO L225 Difference]: With dead ends: 1229 [2021-06-05 21:55:17,149 INFO L226 Difference]: Without dead ends: 1226 [2021-06-05 21:55:17,149 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 573.3ms TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:55:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2021-06-05 21:55:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1027. [2021-06-05 21:55:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.922027290448343) internal successors, (4024), 1026 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4024 transitions. [2021-06-05 21:55:17,161 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4024 transitions. Word has length 19 [2021-06-05 21:55:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:17,161 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4024 transitions. [2021-06-05 21:55:17,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4024 transitions. [2021-06-05 21:55:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:17,162 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:17,162 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:17,363 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5986,496 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:17,363 INFO L430 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:17,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1348863798, now seen corresponding path program 350 times [2021-06-05 21:55:17,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:17,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202310398] [2021-06-05 21:55:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:17,468 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:17,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202310398] [2021-06-05 21:55:17,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202310398] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:17,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727267855] [2021-06-05 21:55:17,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:17,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:17,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:17,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:17,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:17,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:17,573 INFO L388 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 12 [2021-06-05 21:55:17,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:17,575 INFO L388 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 11 [2021-06-05 21:55:17,576 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:17,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:17,590 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:17,590 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 21:55:17,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:17,651 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:17,652 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:17,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:17,655 INFO L388 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 11 [2021-06-05 21:55:17,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:17,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:17,658 INFO L388 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 12 [2021-06-05 21:55:17,659 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:17,661 INFO L388 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 12 [2021-06-05 21:55:17,661 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:17,695 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:17,695 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:17,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:17,696 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:17,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727267855] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:17,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:17,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:17,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483171636] [2021-06-05 21:55:17,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:17,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:17,746 INFO L87 Difference]: Start difference. First operand 1027 states and 4024 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:18,008 INFO L93 Difference]: Finished difference Result 1204 states and 4648 transitions. [2021-06-05 21:55:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:18,008 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:18,010 INFO L225 Difference]: With dead ends: 1204 [2021-06-05 21:55:18,010 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 21:55:18,010 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 321.1ms TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:55:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 21:55:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1012. [2021-06-05 21:55:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 21:55:18,021 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 21:55:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:18,022 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 21:55:18,022 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 21:55:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:18,023 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:18,023 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:18,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 497 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5993 [2021-06-05 21:55:18,223 INFO L430 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1136732820, now seen corresponding path program 351 times [2021-06-05 21:55:18,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:18,224 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888160320] [2021-06-05 21:55:18,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:18,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:18,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888160320] [2021-06-05 21:55:18,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888160320] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:18,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977805389] [2021-06-05 21:55:18,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:18,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:55:18,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:18,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:18,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:18,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:18,473 INFO L388 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 11 [2021-06-05 21:55:18,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:18,476 INFO L388 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 12 [2021-06-05 21:55:18,477 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:18,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:18,493 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:18,493 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:18,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:18,551 INFO L388 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 11 [2021-06-05 21:55:18,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:18,554 INFO L388 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 12 [2021-06-05 21:55:18,554 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:18,569 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:18,569 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:18,570 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:18,570 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:18,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977805389] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:18,600 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:18,600 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:18,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792937799] [2021-06-05 21:55:18,600 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:18,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:18,600 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:18,986 INFO L93 Difference]: Finished difference Result 1117 states and 4331 transitions. [2021-06-05 21:55:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:18,987 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:18,988 INFO L225 Difference]: With dead ends: 1117 [2021-06-05 21:55:18,988 INFO L226 Difference]: Without dead ends: 1117 [2021-06-05 21:55:18,989 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 332.5ms TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 21:55:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-06-05 21:55:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1018. [2021-06-05 21:55:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.927236971484759) internal successors, (3994), 1017 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3994 transitions. [2021-06-05 21:55:18,999 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3994 transitions. Word has length 19 [2021-06-05 21:55:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:18,999 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3994 transitions. [2021-06-05 21:55:18,999 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3994 transitions. [2021-06-05 21:55:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:19,001 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:19,001 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:19,201 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5998,498 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:19,201 INFO L430 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:19,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash -471851450, now seen corresponding path program 352 times [2021-06-05 21:55:19,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:19,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487996763] [2021-06-05 21:55:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:19,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:19,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487996763] [2021-06-05 21:55:19,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487996763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:19,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77588241] [2021-06-05 21:55:19,292 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:19,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:55:19,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:19,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:19,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:19,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:19,404 INFO L388 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 11 [2021-06-05 21:55:19,405 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:19,407 INFO L388 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 12 [2021-06-05 21:55:19,407 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:19,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:19,424 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:19,424 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:19,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:19,492 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:19,493 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:19,494 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 21:55:19,495 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:19,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:55:19,497 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:19,499 INFO L388 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 12 [2021-06-05 21:55:19,500 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:19,514 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 21:55:19,515 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:19,515 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:19,515 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:55:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:19,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77588241] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:19,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:19,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:19,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882389739] [2021-06-05 21:55:19,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:19,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:19,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:19,537 INFO L87 Difference]: Start difference. First operand 1018 states and 3994 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:19,806 INFO L93 Difference]: Finished difference Result 1107 states and 4295 transitions. [2021-06-05 21:55:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:19,806 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:19,808 INFO L225 Difference]: With dead ends: 1107 [2021-06-05 21:55:19,808 INFO L226 Difference]: Without dead ends: 1099 [2021-06-05 21:55:19,808 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 261.0ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:55:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-06-05 21:55:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1018. [2021-06-05 21:55:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.9242871189773845) internal successors, (3991), 1017 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3991 transitions. [2021-06-05 21:55:19,819 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3991 transitions. Word has length 19 [2021-06-05 21:55:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:19,819 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3991 transitions. [2021-06-05 21:55:19,819 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3991 transitions. [2021-06-05 21:55:19,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:19,820 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:19,820 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:20,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 499 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6001 [2021-06-05 21:55:20,020 INFO L430 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1676996606, now seen corresponding path program 353 times [2021-06-05 21:55:20,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:20,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630443198] [2021-06-05 21:55:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:20,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:20,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630443198] [2021-06-05 21:55:20,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630443198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:20,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256269106] [2021-06-05 21:55:20,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:20,225 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:20,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:20,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:20,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:20,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:20,342 INFO L388 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 11 [2021-06-05 21:55:20,343 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:20,345 INFO L388 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 12 [2021-06-05 21:55:20,345 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:20,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:20,361 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:20,362 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:20,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:20,402 INFO L388 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 11 [2021-06-05 21:55:20,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:20,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:20,405 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:20,406 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:20,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:20,409 INFO L388 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 12 [2021-06-05 21:55:20,409 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:20,411 INFO L388 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 12 [2021-06-05 21:55:20,412 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:20,446 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:20,446 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:20,447 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:20,447 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:20,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256269106] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:20,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:20,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:20,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977283789] [2021-06-05 21:55:20,501 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:20,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:20,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:20,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:20,501 INFO L87 Difference]: Start difference. First operand 1018 states and 3991 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:21,005 INFO L93 Difference]: Finished difference Result 1133 states and 4365 transitions. [2021-06-05 21:55:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:55:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:21,007 INFO L225 Difference]: With dead ends: 1133 [2021-06-05 21:55:21,008 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 21:55:21,008 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 507.0ms TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:55:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 21:55:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1021. [2021-06-05 21:55:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.9274509803921567) internal successors, (4006), 1020 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4006 transitions. [2021-06-05 21:55:21,018 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4006 transitions. Word has length 19 [2021-06-05 21:55:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:21,018 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4006 transitions. [2021-06-05 21:55:21,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4006 transitions. [2021-06-05 21:55:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:21,020 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:21,020 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:21,220 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 500 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6008 [2021-06-05 21:55:21,220 INFO L430 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash -481960432, now seen corresponding path program 354 times [2021-06-05 21:55:21,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:21,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961695600] [2021-06-05 21:55:21,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:21,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:21,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961695600] [2021-06-05 21:55:21,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961695600] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:21,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603348101] [2021-06-05 21:55:21,308 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:21,336 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 21:55:21,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:21,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:21,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:21,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:21,419 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:21,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:55:21,421 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:21,438 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:21,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:21,438 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 21:55:21,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:21,477 INFO L388 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 12 [2021-06-05 21:55:21,478 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:21,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:21,480 INFO L388 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 12 [2021-06-05 21:55:21,481 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:21,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:21,483 INFO L388 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 11 [2021-06-05 21:55:21,484 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:21,486 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:21,487 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:21,522 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:55:21,522 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:21,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:21,523 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:55:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:21,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603348101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:21,584 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:21,584 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:21,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031218759] [2021-06-05 21:55:21,584 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:21,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:21,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:21,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:21,584 INFO L87 Difference]: Start difference. First operand 1021 states and 4006 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:21,953 INFO L93 Difference]: Finished difference Result 1126 states and 4344 transitions. [2021-06-05 21:55:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:55:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:21,955 INFO L225 Difference]: With dead ends: 1126 [2021-06-05 21:55:21,955 INFO L226 Difference]: Without dead ends: 1122 [2021-06-05 21:55:21,955 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 327.4ms TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2021-06-05 21:55:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1025. [2021-06-05 21:55:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9267578125) internal successors, (4021), 1024 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4021 transitions. [2021-06-05 21:55:21,965 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4021 transitions. Word has length 19 [2021-06-05 21:55:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:21,966 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4021 transitions. [2021-06-05 21:55:21,966 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4021 transitions. [2021-06-05 21:55:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:21,967 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:21,967 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:22,167 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 501 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6013 [2021-06-05 21:55:22,167 INFO L430 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:22,167 INFO L82 PathProgramCache]: Analyzing trace with hash 946994674, now seen corresponding path program 355 times [2021-06-05 21:55:22,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:22,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629330973] [2021-06-05 21:55:22,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:22,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:22,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629330973] [2021-06-05 21:55:22,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629330973] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:22,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919785897] [2021-06-05 21:55:22,308 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:22,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:22,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:22,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:22,432 INFO L388 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 11 [2021-06-05 21:55:22,432 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:22,434 INFO L388 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 12 [2021-06-05 21:55:22,435 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:22,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:22,451 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:22,451 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:22,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:22,492 INFO L388 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 11 [2021-06-05 21:55:22,493 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:22,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:22,495 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:22,496 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:22,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:22,499 INFO L388 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 12 [2021-06-05 21:55:22,499 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:22,501 INFO L388 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 12 [2021-06-05 21:55:22,502 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:22,535 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:22,535 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:22,536 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:22,536 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:22,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919785897] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:22,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:22,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:22,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64048450] [2021-06-05 21:55:22,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:22,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:22,599 INFO L87 Difference]: Start difference. First operand 1025 states and 4021 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:23,065 INFO L93 Difference]: Finished difference Result 1123 states and 4353 transitions. [2021-06-05 21:55:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:55:23,065 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:23,067 INFO L225 Difference]: With dead ends: 1123 [2021-06-05 21:55:23,067 INFO L226 Difference]: Without dead ends: 1120 [2021-06-05 21:55:23,067 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 468.5ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:55:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2021-06-05 21:55:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1025. [2021-06-05 21:55:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.923828125) internal successors, (4018), 1024 states have internal predecessors, (4018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4018 transitions. [2021-06-05 21:55:23,078 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4018 transitions. Word has length 19 [2021-06-05 21:55:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:23,078 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4018 transitions. [2021-06-05 21:55:23,078 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4018 transitions. [2021-06-05 21:55:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:23,079 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:23,079 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:23,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 502 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6020 [2021-06-05 21:55:23,280 INFO L430 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1873018118, now seen corresponding path program 356 times [2021-06-05 21:55:23,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:23,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585652002] [2021-06-05 21:55:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:23,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:23,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585652002] [2021-06-05 21:55:23,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585652002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:23,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732288386] [2021-06-05 21:55:23,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:23,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:23,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:23,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:23,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:23,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:23,492 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:23,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:55:23,495 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:23,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:23,512 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:23,512 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 21:55:23,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:23,551 INFO L388 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 12 [2021-06-05 21:55:23,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:23,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:23,554 INFO L388 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 12 [2021-06-05 21:55:23,555 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:23,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:23,558 INFO L388 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 11 [2021-06-05 21:55:23,558 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:23,560 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:23,561 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:23,596 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:55:23,596 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:23,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:23,597 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:55:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:23,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732288386] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:23,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:23,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:23,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726453861] [2021-06-05 21:55:23,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:23,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:23,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:23,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:23,646 INFO L87 Difference]: Start difference. First operand 1025 states and 4018 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:23,846 INFO L93 Difference]: Finished difference Result 1108 states and 4307 transitions. [2021-06-05 21:55:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:23,846 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:23,848 INFO L225 Difference]: With dead ends: 1108 [2021-06-05 21:55:23,848 INFO L226 Difference]: Without dead ends: 1108 [2021-06-05 21:55:23,848 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 247.7ms TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:55:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2021-06-05 21:55:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1015. [2021-06-05 21:55:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.9270216962524653) internal successors, (3982), 1014 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3982 transitions. [2021-06-05 21:55:23,859 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3982 transitions. Word has length 19 [2021-06-05 21:55:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:23,859 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3982 transitions. [2021-06-05 21:55:23,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3982 transitions. [2021-06-05 21:55:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:23,860 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:23,860 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:24,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6027,503 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:24,061 INFO L430 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1301813386, now seen corresponding path program 357 times [2021-06-05 21:55:24,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:24,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360370753] [2021-06-05 21:55:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:24,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:24,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360370753] [2021-06-05 21:55:24,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360370753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:24,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730580844] [2021-06-05 21:55:24,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:24,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:55:24,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:24,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:24,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:24,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:24,323 INFO L388 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 11 [2021-06-05 21:55:24,324 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:24,326 INFO L388 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 12 [2021-06-05 21:55:24,326 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:24,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:24,342 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:24,342 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:24,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:24,383 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:24,384 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:24,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:24,386 INFO L388 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 12 [2021-06-05 21:55:24,387 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:24,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:24,390 INFO L388 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 12 [2021-06-05 21:55:24,390 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:24,392 INFO L388 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 11 [2021-06-05 21:55:24,393 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:24,426 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:24,427 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:24,427 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:24,427 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:24,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730580844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:24,489 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:24,489 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:24,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721450005] [2021-06-05 21:55:24,490 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:24,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:24,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:24,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:24,490 INFO L87 Difference]: Start difference. First operand 1015 states and 3982 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:25,017 INFO L93 Difference]: Finished difference Result 1139 states and 4383 transitions. [2021-06-05 21:55:25,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:55:25,017 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:25,019 INFO L225 Difference]: With dead ends: 1139 [2021-06-05 21:55:25,019 INFO L226 Difference]: Without dead ends: 1139 [2021-06-05 21:55:25,019 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 491.0ms TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:55:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-06-05 21:55:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1021. [2021-06-05 21:55:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.930392156862745) internal successors, (4009), 1020 states have internal predecessors, (4009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4009 transitions. [2021-06-05 21:55:25,031 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4009 transitions. Word has length 19 [2021-06-05 21:55:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:25,031 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4009 transitions. [2021-06-05 21:55:25,031 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4009 transitions. [2021-06-05 21:55:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:25,032 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:25,032 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:25,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 504 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6032 [2021-06-05 21:55:25,233 INFO L430 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1798117736, now seen corresponding path program 358 times [2021-06-05 21:55:25,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:25,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276876366] [2021-06-05 21:55:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:25,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:25,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276876366] [2021-06-05 21:55:25,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276876366] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:25,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487293573] [2021-06-05 21:55:25,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:25,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:55:25,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:25,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:25,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:25,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:25,431 INFO L388 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 18 treesize of output 14 [2021-06-05 21:55:25,432 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:25,434 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:25,434 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:25,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:25,452 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:25,452 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 21:55:25,489 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 21:55:25,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:25,498 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:25,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:55:25,501 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:25,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:55:25,504 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:25,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:25,507 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:25,542 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:55:25,542 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:25,543 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:25,543 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:55:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:25,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487293573] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:25,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:25,615 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:25,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293659598] [2021-06-05 21:55:25,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:25,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:25,616 INFO L87 Difference]: Start difference. First operand 1021 states and 4009 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:25,958 INFO L93 Difference]: Finished difference Result 1129 states and 4353 transitions. [2021-06-05 21:55:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:55:25,959 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:25,960 INFO L225 Difference]: With dead ends: 1129 [2021-06-05 21:55:25,961 INFO L226 Difference]: Without dead ends: 1125 [2021-06-05 21:55:25,961 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 326.1ms TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2021-06-05 21:55:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1025. [2021-06-05 21:55:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9296875) internal successors, (4024), 1024 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4024 transitions. [2021-06-05 21:55:25,972 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4024 transitions. Word has length 19 [2021-06-05 21:55:25,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:25,973 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4024 transitions. [2021-06-05 21:55:25,973 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4024 transitions. [2021-06-05 21:55:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:25,974 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:25,975 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:26,187 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 505 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6037 [2021-06-05 21:55:26,187 INFO L430 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash -369162630, now seen corresponding path program 359 times [2021-06-05 21:55:26,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:26,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542681110] [2021-06-05 21:55:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:26,320 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:26,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542681110] [2021-06-05 21:55:26,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542681110] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:26,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542953252] [2021-06-05 21:55:26,320 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:26,349 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:26,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:26,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:26,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:26,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:26,446 INFO L388 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 11 [2021-06-05 21:55:26,447 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:26,449 INFO L388 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 12 [2021-06-05 21:55:26,449 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:26,465 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:26,466 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:26,466 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:26,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:26,507 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:26,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:26,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:26,515 INFO L388 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 12 [2021-06-05 21:55:26,515 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:26,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:26,518 INFO L388 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 12 [2021-06-05 21:55:26,519 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:26,520 INFO L388 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 11 [2021-06-05 21:55:26,521 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:26,554 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:26,555 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:26,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:26,555 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:26,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542953252] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:26,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:26,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:26,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978784467] [2021-06-05 21:55:26,619 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:26,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:26,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:26,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:26,620 INFO L87 Difference]: Start difference. First operand 1025 states and 4024 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:27,162 INFO L93 Difference]: Finished difference Result 1142 states and 4393 transitions. [2021-06-05 21:55:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:55:27,162 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:27,164 INFO L225 Difference]: With dead ends: 1142 [2021-06-05 21:55:27,164 INFO L226 Difference]: Without dead ends: 1139 [2021-06-05 21:55:27,164 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 508.5ms TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:55:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-06-05 21:55:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1025. [2021-06-05 21:55:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9267578125) internal successors, (4021), 1024 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4021 transitions. [2021-06-05 21:55:27,175 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4021 transitions. Word has length 19 [2021-06-05 21:55:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:27,176 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4021 transitions. [2021-06-05 21:55:27,176 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4021 transitions. [2021-06-05 21:55:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:27,177 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:27,177 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:27,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 506 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6044 [2021-06-05 21:55:27,377 INFO L430 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash 556860814, now seen corresponding path program 360 times [2021-06-05 21:55:27,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:27,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935277874] [2021-06-05 21:55:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:27,466 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:27,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935277874] [2021-06-05 21:55:27,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935277874] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:27,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784755610] [2021-06-05 21:55:27,467 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:27,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:55:27,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:27,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:27,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:27,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:27,580 INFO L388 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 18 treesize of output 14 [2021-06-05 21:55:27,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:27,582 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:27,583 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:27,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:27,600 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:27,600 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 21:55:27,638 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 21:55:27,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:27,641 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:27,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:55:27,644 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:27,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 21:55:27,647 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:27,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:27,650 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:27,684 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 21:55:27,685 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:27,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:27,685 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 21:55:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:27,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784755610] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:27,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:27,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:27,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616893675] [2021-06-05 21:55:27,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:27,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:27,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:27,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:27,734 INFO L87 Difference]: Start difference. First operand 1025 states and 4021 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:28,023 INFO L93 Difference]: Finished difference Result 1114 states and 4322 transitions. [2021-06-05 21:55:28,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:28,023 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:28,025 INFO L225 Difference]: With dead ends: 1114 [2021-06-05 21:55:28,025 INFO L226 Difference]: Without dead ends: 1114 [2021-06-05 21:55:28,025 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 275.1ms TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:55:28,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-06-05 21:55:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1018. [2021-06-05 21:55:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.927236971484759) internal successors, (3994), 1017 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3994 transitions. [2021-06-05 21:55:28,036 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3994 transitions. Word has length 19 [2021-06-05 21:55:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:28,036 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3994 transitions. [2021-06-05 21:55:28,036 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3994 transitions. [2021-06-05 21:55:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:28,038 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:28,038 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:28,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6051,507 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:28,238 INFO L430 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:28,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2098209964, now seen corresponding path program 361 times [2021-06-05 21:55:28,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:28,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655155855] [2021-06-05 21:55:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:28,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:28,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655155855] [2021-06-05 21:55:28,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655155855] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:28,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173475511] [2021-06-05 21:55:28,357 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:28,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:28,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:28,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:28,483 INFO L388 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 11 [2021-06-05 21:55:28,483 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:28,485 INFO L388 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 12 [2021-06-05 21:55:28,486 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:28,502 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:28,502 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:28,503 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 21:55:28,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:28,572 INFO L388 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 12 [2021-06-05 21:55:28,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:28,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:55:28,575 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:28,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:55:28,578 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:28,579 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:28,580 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:28,596 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 21:55:28,597 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:28,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:28,597 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 21:55:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:28,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173475511] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:28,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:28,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:28,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75160331] [2021-06-05 21:55:28,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:28,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:28,621 INFO L87 Difference]: Start difference. First operand 1018 states and 3994 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:29,077 INFO L93 Difference]: Finished difference Result 1108 states and 4301 transitions. [2021-06-05 21:55:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:55:29,078 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:29,079 INFO L225 Difference]: With dead ends: 1108 [2021-06-05 21:55:29,079 INFO L226 Difference]: Without dead ends: 1102 [2021-06-05 21:55:29,079 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 437.3ms TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:55:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2021-06-05 21:55:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1018. [2021-06-05 21:55:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.9242871189773845) internal successors, (3991), 1017 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3991 transitions. [2021-06-05 21:55:29,090 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3991 transitions. Word has length 19 [2021-06-05 21:55:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:29,091 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3991 transitions. [2021-06-05 21:55:29,091 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3991 transitions. [2021-06-05 21:55:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:29,092 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:29,092 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:29,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6056,508 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:29,292 INFO L430 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash -316879866, now seen corresponding path program 362 times [2021-06-05 21:55:29,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:29,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679995505] [2021-06-05 21:55:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:29,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:29,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679995505] [2021-06-05 21:55:29,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679995505] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:29,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945324777] [2021-06-05 21:55:29,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:29,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:29,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:29,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:29,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:29,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:29,499 INFO L388 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 18 treesize of output 14 [2021-06-05 21:55:29,500 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:29,501 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:29,502 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:29,519 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 21:55:29,519 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:29,519 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 21:55:29,570 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 21:55:29,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 21:55:29,573 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:29,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 21:55:29,576 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:29,591 INFO L628 ElimStorePlain]: treesize reduction 29, result has 32.6 percent of original size [2021-06-05 21:55:29,591 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:29,592 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:29,592 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:14 [2021-06-05 21:55:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:29,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945324777] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:29,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:29,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 21:55:29,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268300895] [2021-06-05 21:55:29,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 21:55:29,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:29,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 21:55:29,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 21:55:29,614 INFO L87 Difference]: Start difference. First operand 1018 states and 3991 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:29,934 INFO L93 Difference]: Finished difference Result 1111 states and 4316 transitions. [2021-06-05 21:55:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:29,936 INFO L225 Difference]: With dead ends: 1111 [2021-06-05 21:55:29,936 INFO L226 Difference]: Without dead ends: 1111 [2021-06-05 21:55:29,936 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 254.7ms TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 21:55:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-06-05 21:55:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1007. [2021-06-05 21:55:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9343936381709743) internal successors, (3958), 1006 states have internal predecessors, (3958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3958 transitions. [2021-06-05 21:55:29,946 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3958 transitions. Word has length 19 [2021-06-05 21:55:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:29,946 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3958 transitions. [2021-06-05 21:55:29,946 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3958 transitions. [2021-06-05 21:55:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:29,948 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:29,948 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:30,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 509 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6063 [2021-06-05 21:55:30,148 INFO L430 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 927027954, now seen corresponding path program 363 times [2021-06-05 21:55:30,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:30,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779136280] [2021-06-05 21:55:30,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:30,287 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:30,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779136280] [2021-06-05 21:55:30,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779136280] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:30,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608939313] [2021-06-05 21:55:30,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:30,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:55:30,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:30,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:30,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:30,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:30,390 INFO L388 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 11 [2021-06-05 21:55:30,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:30,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:30,393 INFO L388 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 12 [2021-06-05 21:55:30,394 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:30,396 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:30,396 INFO L388 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 12 [2021-06-05 21:55:30,397 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:30,398 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:30,399 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:30,447 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 21:55:30,448 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:55:30,448 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 21:55:30,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:30,563 INFO L388 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 11 [2021-06-05 21:55:30,564 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:30,566 INFO L388 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 12 [2021-06-05 21:55:30,567 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:30,584 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:30,584 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:30,585 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:30,585 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:30,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608939313] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:30,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:30,612 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:30,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418666258] [2021-06-05 21:55:30,612 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:30,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:30,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:30,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:30,613 INFO L87 Difference]: Start difference. First operand 1007 states and 3958 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:31,161 INFO L93 Difference]: Finished difference Result 1308 states and 5048 transitions. [2021-06-05 21:55:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:31,161 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:31,163 INFO L225 Difference]: With dead ends: 1308 [2021-06-05 21:55:31,163 INFO L226 Difference]: Without dead ends: 1308 [2021-06-05 21:55:31,163 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 483.9ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:55:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2021-06-05 21:55:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1016. [2021-06-05 21:55:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 3.9320197044334977) internal successors, (3991), 1015 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 3991 transitions. [2021-06-05 21:55:31,175 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 3991 transitions. Word has length 19 [2021-06-05 21:55:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:31,175 INFO L482 AbstractCegarLoop]: Abstraction has 1016 states and 3991 transitions. [2021-06-05 21:55:31,175 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 3991 transitions. [2021-06-05 21:55:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:31,177 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:31,177 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:31,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 510 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6066 [2021-06-05 21:55:31,377 INFO L430 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1022038400, now seen corresponding path program 364 times [2021-06-05 21:55:31,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:31,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706749605] [2021-06-05 21:55:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:31,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:31,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706749605] [2021-06-05 21:55:31,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706749605] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:31,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393877448] [2021-06-05 21:55:31,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:31,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:55:31,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:31,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:31,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:31,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:31,622 INFO L388 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 11 [2021-06-05 21:55:31,623 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:31,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:31,626 INFO L388 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 12 [2021-06-05 21:55:31,626 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:31,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:31,629 INFO L388 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 12 [2021-06-05 21:55:31,629 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:31,631 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:31,632 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:31,684 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 21:55:31,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:55:31,685 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 21:55:31,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:31,814 INFO L388 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 11 [2021-06-05 21:55:31,815 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:31,816 INFO L388 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 12 [2021-06-05 21:55:31,817 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:31,832 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:31,832 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:31,833 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:31,833 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:31,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393877448] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:31,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:31,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:31,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433554363] [2021-06-05 21:55:31,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:31,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:31,855 INFO L87 Difference]: Start difference. First operand 1016 states and 3991 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:32,328 INFO L93 Difference]: Finished difference Result 1217 states and 4702 transitions. [2021-06-05 21:55:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:32,329 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:32,330 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 21:55:32,330 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 21:55:32,331 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 464.3ms TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 21:55:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 21:55:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1020. [2021-06-05 21:55:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9332679097154073) internal successors, (4008), 1019 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4008 transitions. [2021-06-05 21:55:32,342 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4008 transitions. Word has length 19 [2021-06-05 21:55:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:32,342 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4008 transitions. [2021-06-05 21:55:32,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4008 transitions. [2021-06-05 21:55:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:32,344 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:32,344 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:32,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6072,511 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:32,544 INFO L430 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:32,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1664344626, now seen corresponding path program 365 times [2021-06-05 21:55:32,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:32,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897221825] [2021-06-05 21:55:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:32,653 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:32,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897221825] [2021-06-05 21:55:32,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897221825] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:32,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009891592] [2021-06-05 21:55:32,653 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:32,688 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:32,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:32,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 21:55:32,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:32,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:32,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:32,748 INFO L388 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 11 [2021-06-05 21:55:32,748 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:32,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:32,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:32,751 INFO L388 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 12 [2021-06-05 21:55:32,752 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:32,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:32,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:32,755 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:32,755 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:32,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:32,758 INFO L388 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 12 [2021-06-05 21:55:32,758 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:32,818 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 21:55:32,819 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:55:32,819 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 21:55:33,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 21:55:33,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:33,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 21:55:33,041 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:33,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:33,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:33,044 INFO L388 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 12 [2021-06-05 21:55:33,044 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:33,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:33,047 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:33,047 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:33,070 INFO L628 ElimStorePlain]: treesize reduction 30, result has 38.8 percent of original size [2021-06-05 21:55:33,070 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:33,071 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:33,071 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:13 [2021-06-05 21:55:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:33,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009891592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:33,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:33,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:55:33,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297523202] [2021-06-05 21:55:33,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:55:33,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:55:33,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:55:33,093 INFO L87 Difference]: Start difference. First operand 1020 states and 4008 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:33,841 INFO L93 Difference]: Finished difference Result 1360 states and 5213 transitions. [2021-06-05 21:55:33,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 21:55:33,841 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:33,843 INFO L225 Difference]: With dead ends: 1360 [2021-06-05 21:55:33,843 INFO L226 Difference]: Without dead ends: 1352 [2021-06-05 21:55:33,843 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 775.7ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 21:55:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-06-05 21:55:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1020. [2021-06-05 21:55:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.929342492639843) internal successors, (4004), 1019 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4004 transitions. [2021-06-05 21:55:33,856 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4004 transitions. Word has length 19 [2021-06-05 21:55:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:33,856 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4004 transitions. [2021-06-05 21:55:33,856 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4004 transitions. [2021-06-05 21:55:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:33,857 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:33,857 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:34,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 512 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6078 [2021-06-05 21:55:34,058 INFO L430 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash 459199470, now seen corresponding path program 366 times [2021-06-05 21:55:34,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:34,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623216468] [2021-06-05 21:55:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:34,209 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:34,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623216468] [2021-06-05 21:55:34,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623216468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:34,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148014895] [2021-06-05 21:55:34,210 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:34,238 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 21:55:34,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:34,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:34,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:34,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:34,304 INFO L388 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 11 [2021-06-05 21:55:34,305 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:34,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:34,307 INFO L388 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 12 [2021-06-05 21:55:34,308 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:34,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:34,310 INFO L388 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 12 [2021-06-05 21:55:34,311 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:34,313 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:34,314 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:34,362 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 21:55:34,363 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:55:34,363 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 21:55:34,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:34,472 INFO L388 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 11 [2021-06-05 21:55:34,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:34,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:34,475 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:34,476 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:34,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:34,479 INFO L388 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 12 [2021-06-05 21:55:34,479 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:34,481 INFO L388 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 12 [2021-06-05 21:55:34,482 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:34,515 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:34,516 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:34,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:34,516 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:34,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148014895] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:34,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:34,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:34,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13442879] [2021-06-05 21:55:34,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:34,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:34,571 INFO L87 Difference]: Start difference. First operand 1020 states and 4004 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:35,229 INFO L93 Difference]: Finished difference Result 1217 states and 4703 transitions. [2021-06-05 21:55:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:55:35,229 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:35,231 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 21:55:35,231 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 21:55:35,231 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 635.8ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 21:55:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 21:55:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1024. [2021-06-05 21:55:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 3.9266862170087977) internal successors, (4017), 1023 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 4017 transitions. [2021-06-05 21:55:35,243 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 4017 transitions. Word has length 19 [2021-06-05 21:55:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:35,243 INFO L482 AbstractCegarLoop]: Abstraction has 1024 states and 4017 transitions. [2021-06-05 21:55:35,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 4017 transitions. [2021-06-05 21:55:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:35,244 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:35,244 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:35,445 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 513 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6089 [2021-06-05 21:55:35,445 INFO L430 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash -285753102, now seen corresponding path program 367 times [2021-06-05 21:55:35,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:35,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587679749] [2021-06-05 21:55:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:35,558 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:35,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587679749] [2021-06-05 21:55:35,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587679749] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:35,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626185931] [2021-06-05 21:55:35,558 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:35,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:35,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:35,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,648 INFO L388 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 11 [2021-06-05 21:55:35,648 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:35,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,651 INFO L388 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 12 [2021-06-05 21:55:35,652 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:35,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,655 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:35,656 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:35,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,658 INFO L388 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 12 [2021-06-05 21:55:35,659 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:35,717 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 21:55:35,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:55:35,718 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 21:55:35,903 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 21:55:35,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,907 INFO L388 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 11 [2021-06-05 21:55:35,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:35,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,910 INFO L388 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 12 [2021-06-05 21:55:35,911 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:35,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:35,914 INFO L388 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 12 [2021-06-05 21:55:35,914 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:35,917 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:35,918 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:35,968 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 21:55:35,968 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 21:55:35,969 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:35,969 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 21:55:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:36,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626185931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:36,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:36,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 21:55:36,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46711346] [2021-06-05 21:55:36,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 21:55:36,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 21:55:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 21:55:36,021 INFO L87 Difference]: Start difference. First operand 1024 states and 4017 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:37,137 INFO L93 Difference]: Finished difference Result 1401 states and 5347 transitions. [2021-06-05 21:55:37,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 21:55:37,138 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:37,140 INFO L225 Difference]: With dead ends: 1401 [2021-06-05 21:55:37,140 INFO L226 Difference]: Without dead ends: 1401 [2021-06-05 21:55:37,141 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1079.9ms TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 21:55:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2021-06-05 21:55:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1014. [2021-06-05 21:55:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 3.9378084896347483) internal successors, (3989), 1013 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 3989 transitions. [2021-06-05 21:55:37,153 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 3989 transitions. Word has length 19 [2021-06-05 21:55:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:37,154 INFO L482 AbstractCegarLoop]: Abstraction has 1014 states and 3989 transitions. [2021-06-05 21:55:37,154 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 3989 transitions. [2021-06-05 21:55:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:37,155 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:37,155 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:37,355 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6097,514 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:37,355 INFO L430 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash -562698806, now seen corresponding path program 368 times [2021-06-05 21:55:37,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:37,356 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698258758] [2021-06-05 21:55:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:37,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:37,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698258758] [2021-06-05 21:55:37,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698258758] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:37,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051434953] [2021-06-05 21:55:37,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:37,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:55:37,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:37,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:37,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:37,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:37,582 INFO L388 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 11 [2021-06-05 21:55:37,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:37,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:37,585 INFO L388 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 12 [2021-06-05 21:55:37,586 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:37,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:37,588 INFO L388 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 12 [2021-06-05 21:55:37,589 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:37,591 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:37,592 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:37,641 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 21:55:37,642 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:55:37,642 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 21:55:37,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:37,757 INFO L388 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 11 [2021-06-05 21:55:37,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:37,760 INFO L388 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 12 [2021-06-05 21:55:37,760 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:37,775 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:37,775 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:37,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:37,776 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:37,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051434953] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:37,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:37,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:37,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350989454] [2021-06-05 21:55:37,798 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:37,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:37,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:37,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:37,799 INFO L87 Difference]: Start difference. First operand 1014 states and 3989 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:38,416 INFO L93 Difference]: Finished difference Result 1250 states and 4841 transitions. [2021-06-05 21:55:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:38,418 INFO L225 Difference]: With dead ends: 1250 [2021-06-05 21:55:38,418 INFO L226 Difference]: Without dead ends: 1250 [2021-06-05 21:55:38,418 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 541.3ms TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-06-05 21:55:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-06-05 21:55:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1019. [2021-06-05 21:55:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.93713163064833) internal successors, (4008), 1018 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4008 transitions. [2021-06-05 21:55:38,431 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4008 transitions. Word has length 19 [2021-06-05 21:55:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:38,431 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4008 transitions. [2021-06-05 21:55:38,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4008 transitions. [2021-06-05 21:55:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:38,432 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:38,432 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:38,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6105,515 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:38,632 INFO L430 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:38,633 INFO L82 PathProgramCache]: Analyzing trace with hash 398399508, now seen corresponding path program 369 times [2021-06-05 21:55:38,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:38,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536382618] [2021-06-05 21:55:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:38,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:38,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536382618] [2021-06-05 21:55:38,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536382618] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:38,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104103306] [2021-06-05 21:55:38,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:38,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 21:55:38,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:38,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:38,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:38,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:38,873 INFO L388 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 11 [2021-06-05 21:55:38,874 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:38,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:38,876 INFO L388 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 12 [2021-06-05 21:55:38,877 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:38,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:38,879 INFO L388 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 12 [2021-06-05 21:55:38,880 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:38,882 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:38,883 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:38,930 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 21:55:38,931 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:55:38,931 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 21:55:39,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:39,061 INFO L388 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 11 [2021-06-05 21:55:39,062 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:39,064 INFO L388 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 12 [2021-06-05 21:55:39,064 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:39,079 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 21:55:39,079 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:39,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 21:55:39,080 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 21:55:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:39,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104103306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:39,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:39,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:39,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758304161] [2021-06-05 21:55:39,102 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:39,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:39,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:39,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:39,102 INFO L87 Difference]: Start difference. First operand 1019 states and 4008 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:55:39,735 INFO L93 Difference]: Finished difference Result 1133 states and 4379 transitions. [2021-06-05 21:55:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 21:55:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:55:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:55:39,737 INFO L225 Difference]: With dead ends: 1133 [2021-06-05 21:55:39,737 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 21:55:39,738 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 601.9ms TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 21:55:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 21:55:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1021. [2021-06-05 21:55:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.9352941176470586) internal successors, (4014), 1020 states have internal predecessors, (4014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4014 transitions. [2021-06-05 21:55:39,749 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4014 transitions. Word has length 19 [2021-06-05 21:55:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:55:39,749 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4014 transitions. [2021-06-05 21:55:39,749 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:55:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4014 transitions. [2021-06-05 21:55:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:55:39,750 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:55:39,750 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:55:39,951 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 516 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6111 [2021-06-05 21:55:39,951 INFO L430 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:55:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:55:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash 325027028, now seen corresponding path program 370 times [2021-06-05 21:55:39,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:55:39,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269054777] [2021-06-05 21:55:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:55:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:55:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:40,102 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:55:40,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269054777] [2021-06-05 21:55:40,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269054777] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:40,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718303548] [2021-06-05 21:55:40,102 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:40,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 21:55:40,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:55:40,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 21:55:40,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:55:40,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:40,195 INFO L388 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 11 [2021-06-05 21:55:40,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:40,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:40,198 INFO L388 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 12 [2021-06-05 21:55:40,199 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:40,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:40,201 INFO L388 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 12 [2021-06-05 21:55:40,202 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:40,204 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:40,204 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:40,253 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 21:55:40,254 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 21:55:40,254 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 21:55:40,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:40,360 INFO L388 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 12 [2021-06-05 21:55:40,361 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:40,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:40,363 INFO L388 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 17 treesize of output 13 [2021-06-05 21:55:40,364 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:40,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 21:55:40,367 INFO L388 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 12 [2021-06-05 21:55:40,367 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:40,369 INFO L388 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 11 [2021-06-05 21:55:40,370 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 21:55:40,412 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 21:55:40,412 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 21:55:40,412 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 21:55:40,412 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 21:55:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:55:40,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718303548] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:55:40,469 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:55:40,469 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 21:55:40,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028210953] [2021-06-05 21:55:40,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 21:55:40,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:55:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 21:55:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 21:55:40,470 INFO L87 Difference]: Start difference. First operand 1021 states and 4014 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2021-06-05 21:55:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 21:55:40,970 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6117,517 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:55:40,970 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 21:55:40,972 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 21:55:40,974 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 21:55:40,974 INFO L202 PluginConnector]: Adding new model array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 09:55:40 BasicIcfg [2021-06-05 21:55:40,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 21:55:40,975 INFO L168 Benchmark]: Toolchain (without parser) took 798530.89 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 340.7 MB in the beginning and 314.4 MB in the end (delta: 26.3 MB). Peak memory consumption was 101.9 MB. Max. memory is 16.0 GB. [2021-06-05 21:55:40,975 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 360.7 MB. Free memory was 342.0 MB in the beginning and 342.0 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 21:55:40,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.91 ms. Allocated memory is still 360.7 MB. Free memory was 340.6 MB in the beginning and 339.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 21:55:40,975 INFO L168 Benchmark]: Boogie Preprocessor took 26.24 ms. Allocated memory is still 360.7 MB. Free memory was 339.2 MB in the beginning and 338.1 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 21:55:40,975 INFO L168 Benchmark]: RCFGBuilder took 451.85 ms. Allocated memory is still 360.7 MB. Free memory was 338.0 MB in the beginning and 341.8 MB in the end (delta: -3.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.0 GB. [2021-06-05 21:55:40,975 INFO L168 Benchmark]: TraceAbstraction took 798021.79 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 341.8 MB in the beginning and 314.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 101.4 MB. Max. memory is 16.0 GB. [2021-06-05 21:55:40,976 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.12 ms. Allocated memory is still 360.7 MB. Free memory was 342.0 MB in the beginning and 342.0 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 25.91 ms. Allocated memory is still 360.7 MB. Free memory was 340.6 MB in the beginning and 339.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.24 ms. Allocated memory is still 360.7 MB. Free memory was 339.2 MB in the beginning and 338.1 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 451.85 ms. Allocated memory is still 360.7 MB. Free memory was 338.0 MB in the beginning and 341.8 MB in the end (delta: -3.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 798021.79 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 341.8 MB in the beginning and 314.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 101.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1021states) and FLOYD_HOARE automaton (currently 6 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 32 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 797917.0ms, OverallIterations: 596, TraceHistogramMax: 2, EmptinessCheckTime: 433.4ms, AutomataDifference: 359998.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 18361 SDtfs, 40851 SDslu, 100312 SDs, 0 SdLazy, 235641 SolverSat, 4985 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 115424.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17978 GetRequests, 6999 SyntacticMatches, 479 SemanticMatches, 10500 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28672 ImplicationChecksByTransitivity, 402104.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1071occurred in iteration=472, InterpolantAutomatonStates: 6248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3848.4ms AutomataMinimizationTime, 595 MinimizatonAttempts, 59703 StatesRemovedByMinimization, 594 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2315.3ms SsaConstructionTime, 5739.0ms SatisfiabilityAnalysisTime, 309802.5ms InterpolantComputationTime, 19098 NumberOfCodeBlocks, 19098 NumberOfCodeBlocksAsserted, 1577 NumberOfCheckSat, 17986 ConstructedInterpolants, 466 QuantifiedInterpolants, 404327 SizeOfPredicates, 4581 NumberOfNonLiveVariables, 38296 ConjunctsInSsa, 10408 ConjunctsInUnsatCore, 1112 InterpolantComputations, 80 PerfectInterpolantSequences, 522/4196 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